New algorithms for the duplication-loss model
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
From Gene Trees to Species Trees
SIAM Journal on Computing
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
DLS-trees: a model of evolutionary scenarios
Theoretical Computer Science
Comparing Genomes with Duplications: A Computational Complexity Point of View
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Evolution of tandemly arrayed genes in multiple species
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Hi-index | 0.00 |
We consider two questions related to the evolution of gene families. First, given a gene tree for a gene family, can the evolutionary history of this family be explained with only speciation and duplication events, and without gene loss. We show that this question can be answered in linear time, and that such a gene tree induces a single species tree consistent with a history with no loss. We then present a heuristic for the following problem: if a gene tree can not be explained without gene loss, what is the minimum number of losses involved in an evolutionary history of the gene family. We finally evaluate our algorithms on a dataset of plants gene families.