The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Species Tree Inference by Minimizing Deep Coalescences
Open accessAbstract
In a 1997 seminal paper, W. Maddison proposed minimizing deep coalescences, or MDC, as an optimization criterion for inferring the species tree from a set of incongruent gene trees, assuming the incongruence is exclusively due to lineage sorting. In a subsequent paper, Maddison and Knowles provided and implemented a search heuristic for optimizing the MDC criterion, given a set of gene trees. However, the heuristic is not guaranteed to compute optimal solutions, and its hill-climbing search makes it slow in practice. In this paper, we provide two exact solutions to the problem of inferring the species tree from a set of gene trees under the MDC criterion. In other words, our solutions are guaranteed to find the tree that minimizes the total number of deep coalescences from a set of gene trees. One solution is based on a novel integer linear programming (ILP) formulation, and another is based on a simple dynamic programming (DP) approach. Powerful ILP solvers, such as CPLEX, make the first solution appealing, particularly for very large-scale instances of the problem, whereas the DP-based solution eliminates dependence on proprietary tools, and its simplicity makes it easy to integrate with other genomic events that may cause gene tree incongruence. Using the exact solutions, we analyze a data set of 106 loci from eight yeast species, a data set of 268 loci from eight Apicomplexan species, and several simulated data sets. We show that the MDC criterion provides very accurate estimates of the species tree topologies, and that our solutions are very fast, thus allowing for the accurate analysis of genome-scale data sets. Further, the efficiency of the solutions allow for quick exploration of sub-optimal solutions, which is important for a parsimony-based criterion such as MDC, as we show. We show that searching for the species tree in the compatibility graph of the clusters induced by the gene trees may be sufficient in practice, a finding that helps ameliorate the computational requirements of optimization solutions. Further, we study the statistical consistency and convergence rate of the MDC criterion, as well as its optimality in inferring the species tree. Finally, we show how our solutions can be used to identify potential horizontal gene transfer events that may have caused some of the incongruence in the data, thus augmenting Maddison's original framework. We have implemented our solutions in the PhyloNet software package, which is freely available at: http://bioinfo.cs.rice.edu/phylonet.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genome-scale approaches to resolving incongruence in molecular phylogenies.
Rokas, A., Williams, B. L., King, N., & Carroll, S. B. (2003) · Nature · doi:10.1038/nature02053 · Cited by 1,512
Cited by
Quartet Inference from SNP Data Under the Coalescent Model
Chifman, J., & Kubatko, L. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu530 · Cited by 1,185
Resolving difficult phylogenetic questions: Why more sequences are not enough
Philippe, H., Brinkmann, H., Lavrov, D. V., Littlewood, D. T. J., Manuel, M., Wörheide, G., & Baurain, D. (2011) · PLoS Biology · doi:10.1371/journal.pbio.1000602 · Cited by 1,129
Molecular phylogenetics: principles and practice
Yang, Z., & Rannala, B. (2012) · Nature Reviews Genetics · doi:10.1038/nrg3186 · Cited by 752
Genome-Wide Inference of Ancestral Recombination Graphs
Rasmussen, M. D., Hubisz, M. J., Gronau, I., & Siepel, A. (2014) · PLoS Genetics · doi:10.1371/journal.pgen.1004342 · Cited by 371
Inferring Phylogenetic Networks Using PhyloNet
Wen, D., Yu, Y., Zhu, J., & Nakhleh, L. (2018) · Systematic Biology · doi:10.1093/sysbio/syy015 · Cited by 352
Self-citation
Metadata
- Authors
- Than, C., & Nakhleh, L.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2009-09-11
- Volume
- 5
- Issue
- 9
- Pages
- e1000501
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2039334367
- Cited by
- 191
- References
- 1
- FWCI
- 6.00
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Species Tree Inference by Minimizing Deep Coalescences. https://app.cochat.ai/papers/10.1371/journal.pcbi.1000501
- The paper
- Than, C., & Nakhleh, L. (2009). Species Tree Inference by Minimizing Deep Coalescences. PLoS Computational Biology. https://doi.org/10.1371/journal.pcbi.1000501
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.