Reconciling gene trees with apparent polytomies

41Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this problem handle only binary gene trees or interpret polytomies in the gene tree as true. While in practice polytomies occur frequently, they are typically not true. Most polytomies represent unresolved evolutionary relationships. In this case a polytomy is called apparent. In this work we modify the problem of reconciling gene and species trees by interpreting polytomies to be apparent, based on a natural extension of the Gene Duplication model. We further provide polynomial time algorithms to solve this modified problem. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Chang, W. C., & Eulenstein, O. (2006). Reconciling gene trees with apparent polytomies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 235–244). Springer Verlag. https://doi.org/10.1007/11809678_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free