An Improved Algorithm for the Macro-evolutionary Phylogeny Problem

  • Behshad Behzadi
  • Martin Vingron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4009)


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


Species Tree Gene Duplication Gene Tree Improve Algorithm Optimal Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arvestad, L., Berglund, A.C., Lagergren, J., Sennblad, B.: Gene tree reconstruction and orthology analysis based on an integrated model for duplication and sequence evolution. In: Proc. RECOMB 2004, pp. 326–335. ACM Press, New York (2004)CrossRefGoogle Scholar
  2. 2.
    Arvestad, L., Berglund, A.C., Lagergren, J., Sennblad, B.: Bayesian gene/species tree reconciliation and orthology analysis using MCMC. Bioinformatics 19(Suppl. 1), 7–15 (2003)CrossRefGoogle Scholar
  3. 3.
    Chor, B., Tuller, T.: Maximum likelihood of evolutionary trees is hard. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 296–310. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Day, W.H.: Computational complexity of inferring phylogenies from dissimilarity matrices. Bull. Math. Biol. 49(4), 461–467 (1987)MathSciNetMATHGoogle Scholar
  5. 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
  6. 6.
    Eulenstein, O., Mikrin, B., Vingron, M.: Duplication-based measures of difference between gene and species trees. Journal of Computational Biology 5, 135–148 (1998)CrossRefGoogle Scholar
  7. 7.
    Felsenstein, J.: Phylogenies from molecular sequences: Inference and reliability. Annu. Rev. Genet. 22, 521–565 (1988)CrossRefGoogle Scholar
  8. 8.
    Fitch, W., Margoliash, E.: Construction of phylogenetic trees. Science 155, 279–284 (1967)CrossRefGoogle Scholar
  9. 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
  10. 10.
    Guigo, R., Muchnik, I., Smith, T.F.: Reconstruction of ancient phylogenies. Molecular Phylogenetics and Evolution 6, 189–213 (1996)CrossRefGoogle Scholar
  11. 11.
    Hallett, M.T., Lagergren, J.: New algorithms for the duplication-loss model. In: Proc. RECOMB 2000 (2000)Google Scholar
  12. 12.
    Ma, B., Li, M., Zhang, L.: From gene trees to species trees. SIAM J. on comput. (2000)Google Scholar
  13. 13.
    Mirkin, B., Muchnik, I., Smith, T.F.: A biologically consistent model for comparing molecular phylogenies. Journal of Computational Biology 2, 493–507 (1995)CrossRefGoogle Scholar
  14. 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. 15.
    Nei, M.: Molecular Evolution Genetics. Columbia University Press, New York (1987)Google Scholar
  16. 16.
    Zmasek, C.M., Eddy, S.R.: A simple algorithm to infer gene duplication and speciation events on a gene tree. Bioinformatics 17(9), 821–828 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Behshad Behzadi
    • 1
  • Martin Vingron
    • 1
  1. 1.Computational Molecular Biology DepartmentMax Planck Institute for Molecular GeneticsBerlinGermany

Personalised recommendations