2013
DOI: 10.1186/1471-2105-14-s15-s6
|View full text |Cite
|
Sign up to set email alerts
|

Fast algorithms and heuristics for phylogenomics under ILS and hybridization

Abstract: BackgroundPhylogenomic analyses involving whole-genome or multi-locus data often entail dealing with incongruent gene trees. In this paper, we consider two causes of such incongruence, namely, incomplete lineage sorting (ILS) and hybridization, and consider both parsimony and probabilistic criteria for dealing with them.ResultsUnder the assumption of ILS, computing the probability of a gene tree given a species tree is a very hard problem. We present a heuristic for speeding up the computation, and demonstrate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
39
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
2
2
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 41 publications
(41 citation statements)
references
References 28 publications
2
39
0
Order By: Relevance
“…where τ Ψ ðbÞ for edge b = ðx; yÞ is the time of node x in the phylogenetic network Ψ. A full derivation of the formula and a more efficient algorithm for computing it along the lines of Yu et al (17), which avoid explicit summations over the possible coalescent histories, are given in SI Appendix.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…where τ Ψ ðbÞ for edge b = ðx; yÞ is the time of node x in the phylogenetic network Ψ. A full derivation of the formula and a more efficient algorithm for computing it along the lines of Yu et al (17), which avoid explicit summations over the possible coalescent histories, are given in SI Appendix.…”
Section: Resultsmentioning
confidence: 99%
“…A major direction for future research is scaling up our methods to larger datasets. Currently, it takes a few seconds to a few minutes to evaluate the likelihood of a phylogenetic network with 10-20 taxa (17). This running time can vary significantly even among networks with the same numbers of taxa and reticulation events, because the shape of the gene tree and the configuration of the reticulation nodes in the network (their locations and interdependencies) are the crucial factors (27).…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…The reason for this is that 184 when partial likelihood vectors are split (described below), those become symbolic terms 185 that do not evaluate to partial likelihoods until they are merged later. This is analogous 186 to the difference between ancestral configurations on species trees [31] and their labeled 187 counterparts on phylogenetic networks [32], where the latter are in many cases just 188 symbolic terms that do not evaluate to true (partial) likelihood values.…”
mentioning
confidence: 99%