Macro-evolutionary processes (e.g., gene duplication and loss) have rarely been incorporated into gene phylogeny reconstruction methods. Durand et al. [5] have proposed a polynomial time dynamic programming algorithm to find the gene family tree that optimizes a macro-evolutionary criterion which is the weighted sum of the number of gene duplications and losses. The complexity of this algorithm is O(nm 2) where n is the number of species and m is the maximum number of copies of the gene in a species. In this paper, we propose an improved algorithm with time complexity of O(nm) for solving this problem. We also show, that the problem can be solved in O(n) if unit coats are considered for both loss and duplication. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Behzadi, B., & Vingron, M. (2006). An improved algorithm for the macro-evolutionary phylogeny problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4009 LNCS, pp. 177–187). Springer Verlag. https://doi.org/10.1007/11780441_17
Mendeley helps you to discover research relevant for your work.