期刊
JOURNAL OF COMPUTATIONAL BIOLOGY
卷 18, 期 1, 页码 1-15出版社
MARY ANN LIEBERT INC
DOI: 10.1089/cmb.2010.0102
关键词
algorithms; combinatorial optimization; combinatorics; computational molecular biology; phylogenetic trees
类别
资金
- Burroughs Wellcome Fund
- Alfred P. Sloan Foundation
- National Science Foundation [DEB-0716904]
Methods for inferring species trees from sets of gene trees need to account for the possibility of discordance among the gene trees. Assuming that discordance is caused by incomplete lineage sorting, species tree estimates can be obtained by finding those species trees that minimize the number of deep'' coalescence events required for a given collection of gene trees. Efficient algorithms now exist for applying the minimizing-deep-coalescence (MDC) criterion, and simulation experiments have demonstrated its promising performance. However, it has also been noted from simulation results that the MDC criterion is not always guaranteed to infer the correct species tree estimate. In this article, we investigate the consistency of the MDC criterion. Using the multipscies coalescent model, we show that there are indeed anomaly zones for the MDC criterion for asymmetric four-taxon species tree topologies, and for all species tree topologies with five or more taxa.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据