An Improved Algorithm for the Macro-evolutionary Phylogeny Problem
Macro-evolutionary processes (e.g., gene duplication and loss) have rarely been incorporated into gene phylogeny reconstruction methods. Durand et al.  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 costs are considered for both loss and duplication.
KeywordsSpecies Tree Gene Duplication Gene Tree Improve Algorithm Optimal Interval
Unable to display preview. Download preview PDF.
- 5.Durand, D., Halldórsson, B.V., Vernot, B.: A Hybrid Micro-Macroevolutionary Approach to Gene Tree Reconstruction. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 250–264. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 9.Goodman, M., Czelusniak, J., Moore, G.W., Romero-Herrera, A.E., Matsuda, G.: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst. Zool. 28, 138–163 (1979)Google Scholar
- 11.Hallett, M.T., Lagergren, J.: New algorithms for the duplication-loss model. In: Proc. RECOMB 2000 (2000)Google Scholar
- 12.Ma, B., Li, M., Zhang, L.: From gene trees to species trees. SIAM J. on comput. (2000)Google Scholar
- 14.Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms and areas. Syst. Zool. 43, 58–77 (1994)Google Scholar
- 15.Nei, M.: Molecular Evolution Genetics. Columbia University Press, New York (1987)Google Scholar