Advertisement

Reconciling Gene Trees with Apparent Polytomies

  • Wen-Chieh Chang
  • Oliver Eulenstein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4112)

Abstract

We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this problem handle only binary gene trees or interpret polytomies in the gene tree as true. While in practice polytomies occur frequently, they are typically not true. Most polytomies represent unresolved evolutionary relationships. In this case a polytomy is called apparent. In this work we modify the problem of reconciling gene and species trees by interpreting polytomies to be apparent, based on a natural extension of the Gene Duplication model. We further provide polynomial time algorithms to solve this modified problem.

Keywords

Species Tree Normal Form Gene Duplication Gene Tree Polynomial Time Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Page, R.D.M., Holmes, E.C.: Molecular Evolution: A Phylogenetic Approach. Blackwell Science Ltd., Osney Mead (1998)Google Scholar
  2. 2.
    Felsenstein, J.: Inferring phylogenies. Sinauer Associates Inc., Sunderland (2004)Google Scholar
  3. 3.
    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. Systematic Zoology 28, 132–163 (1979)CrossRefGoogle Scholar
  4. 4.
    Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology 43(1), 58–77 (1994)Google Scholar
  5. 5.
    Eulenstein, O.: A linear time algorithm for tree mapping, Arbeitspapire der GMD, 1046 (1997) (access date: February 19, 2006), http://taxonomy.zoology.gla.ac.uk/rod/genetree/maths/maths.html
  6. 6.
    Eulenstein, O.: Vorhersage von Genduplikationen und deren Entwicklung in der Evolution. Ph.d. dissertation, Bonn University, GMD Research Series, 20 (1998), http://www.bi.fraunhofer.de/publications/research/1998/020/Text.pdf
  7. 7.
    Ma, B., Li, M., Zhang, L.: On reconstructing species trees from gene trees in term of duplications and losses. In: RECOMB, pp. 182–191 (1998)Google Scholar
  8. 8.
    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
  9. 9.
    Maddison, W.P.: Reconstructing character evolution on polytomous cladgrams. Cladistics 5, 365–377 (1989)CrossRefGoogle Scholar
  10. 10.
    Slowinski, J.B.: Molecular polytomies. Molecular Phylogenetics and Evolution 19(1), 114–120 (2001)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Guigó, R., Muchnik, I., Smith, T.F.: Reconstruction of ancient molecular phylogeny. Molecular Phylogenetics and Evolution 6(2), 198–213 (1996)CrossRefGoogle Scholar
  12. 12.
    Mirkin, B., Muchnik, I., Smith, T.F.: A biologically meaningful model for comparing molecular phylogenies. Journal of Computational Biology 2, 493–507 (1995)CrossRefGoogle Scholar
  13. 13.
    Zhang, L.: On a mirkin-muchnik-smith conjecture for comparing molecular phylogenies. Journal of Computational Biology 4(2), 177–187 (1997)CrossRefGoogle Scholar
  14. 14.
    Chen, K., Durand, D., Farach-Colton, M.: Notung: Dating gene duplications using gene family trees. In: RECOMB, pp. 96–106 (2000)Google Scholar
  15. 15.
    Bonizzoni, P., Vedova, G.D., Dondi, R.: Reconciling gene trees to a species tree. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  16. 16.
    Górecki, P., Tiuryn, J.: On the structure of reconciliations. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol. 3388, pp. 42–54. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Bender, M.A., Farach-Colton, M.: The lca problem revisited. Latin American Theoretical Informatics, 88–94 (April 2000)Google Scholar
  18. 18.
    Chang, W.C., Eulenstein, O.: Reconciling gene trees with apparent polytimies. Technical report, Department of Computer Science, Iowa State University (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wen-Chieh Chang
    • 1
  • Oliver Eulenstein
    • 1
  1. 1.Department of Computer ScienceIowa State UniversityAmesUSA

Personalised recommendations