On the complexity of comparing evolutionary trees
Discrete Applied Mathematics - Special volume on computational molecular biology
On reconstructing species trees from gene trees in term of duplications and losses
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
On the Multiple Gene Duplication Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Parameterized Complexity
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
A hybrid micro-macroevolutionary approach to gene tree reconstruction
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Complexity insights of the minimum duplication problem
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
An Ω(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
GENE DUPLICATION is the problem of computing an optimal species tree for a given set of gene trees under the GENE DUPLICATION Model (first introduced by Goodman et al.). The problem is known to be NP-complete. We give a fixed-parameter-tractable algorithm solving the problem parameterized by the number of gene duplications necessary to rectify the gene trees with respect to the species tree.