# Item

ITEM ACTIONSEXPORT

Released

Book Chapter

#### An Improved Algorithm for the Macro-evolutionary Phylogeny Problem

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Behzadi, B., & Vingron, M. (2006). An Improved Algorithm for the Macro-evolutionary
Phylogeny Problem. In *Combinatorial Pattern Matching* (pp. 177-187). Berlin/Heidelberg:
Springer.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-84E8-7

##### Abstract

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(nm2) 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 costs are considered for both loss and duplication.