Reconciling Gene Trees to a Species Tree

  • Paola Bonizzoni
  • Gianluca Della Vedova
  • Riccardo Dondi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2653)


In this paper we deal with the general problem of recombining the information from evolutionary trees representing the relationships between distinct gene families. First we solve a problem from [8] regarding the construction of a minimum reconciled tree by giving an efficient algorithm. Then we show that the exemplar problem, arising from the exemplar analysis of multigene genomes [2], is NP-hard even when the number of copies of a given label is at most two. Finally we introduce two novel formulations for the problem of recombining evolutionary trees, extending the notion of the gene duplication problem studied in [88,11,9,10,6], and we give an exact algorithm (via dynamic programming) for one of the formulations given.


Species Tree Gene Tree Internal Node Evolutionary Tree Node Cover 
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.
    Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001.Google Scholar
  2. 2.
    N. El-Mabrouk, D. Sankoff Duplication, Rearrangement and Reconciliation. In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map alignment and the Evolution of Gene Families. Computational Biology Series. Kluwer Academic Publishers. Vol 1. pages 537–550 (2000), 2000.Google Scholar
  3. 3.
    M. R. Fellows, M. T. Hallett, U. Stege. On the Multiple Gene Duplication Problem. In Proccedings of International Symposium on Algorithms and Computation 1998 (ISAAC 1998), pages 347–356, 1998.Google Scholar
  4. 4.
    M. R. Garey, D. S. Johnson. Computer and Intractability: A Guide to NP-Completeness. W. H. Freeman, 1979.Google Scholar
  5. 5.
    M. Goodman, J. Czelusniak, G.W. Moore, A.E. Romero-Herrera, and G. Matsuda. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Systematic Zoology, (28):132–163, 1979.Google Scholar
  6. 6.
    R. Guigò, I. Muchnik, and T. Smith. Reconstruction of ancient molecular phylogeny. Mol. Phy. and Evol., 6(2):189–213, 1996.CrossRefGoogle Scholar
  7. 7.
    M. T. Hallett, and J. Lagergren. New algorithms for the duplication-loss model. In Proceedings of the Fourth Annual International Conference on Computational Biology 2000 (RECOMB 2000), pages 138–146, 2000.Google Scholar
  8. 8.
    B. Ma, M. Li, and L. Zhang. From gene trees to species trees. SIAM Journal on Computing, 30(3):729–752, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    R.D. M. Page. Maps between trees and cladistic analysis of historical associations among genes. Systematic Biology, 43:58–77, 1994.CrossRefGoogle Scholar
  10. 10.
    R.D. M. Page and J. Cotton. Vertebrate phylogenomics: reconciled trees and gene duplications. In Proceedings of Pacific Symposium on Biocomputing 2002 (PSB2002), pages 536–547, 2002.Google Scholar
  11. 11.
    U. Stege. Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable. In Proceedings of Workshop on Algorithms And Data Structures 1999 (WADS’99), pages 288–293, 1999Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Paola Bonizzoni
    • 1
  • Gianluca Della Vedova
    • 2
  • Riccardo Dondi
    • 1
  1. 1.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità degli Studi di Milano-BicoccaMilanoItaly
  2. 2.Dipartimento di StatisticaUniversitä degli Studi di Milano-BicoccaMilanoItaly

Personalised recommendations