Format

Send to:

Choose Destination
See comment in PubMed Commons below
J Comput Biol. 2011 Nov;18(11):1543-59. doi: 10.1089/cmb.2011.0174. Epub 2011 Oct 28.

Algorithms for MDC-based multi-locus phylogeny inference: beyond rooted binary gene trees on single alleles.

Author information

  • 1Department of Computer Science, Rice University, Houston, Texas 77005, USA.

Abstract

One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is Minimize Deep Coalescence (MDC). Exact algorithms for inferring the species tree from rooted, binary trees under MDC were recently introduced. Nevertheless, in phylogenetic analyses of biological data sets, estimated gene trees may differ from true gene trees, be incompletely resolved, and not necessarily rooted. In this article, we propose new MDC formulations for the cases where the gene trees are unrooted/binary, rooted/non-binary, and unrooted/non-binary. Further, we prove structural theorems that allow us to extend the algorithms for the rooted/binary gene tree case to these cases in a straightforward manner. In addition, we devise MDC-based algorithms for cases when multiple alleles per species may be sampled. We study the performance of these methods in coalescent-based computer simulations.

PMID:
22035329
[PubMed - indexed for MEDLINE]
PMCID:
PMC3216099
Free PMC Article
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Mary Ann Liebert, Inc. Icon for PubMed Central
    Loading ...
    Write to the Help Desk