From gene trees to species trees

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 729-752

  Ma, Bin ^a   Li, Ming ^b   Zhang, Louxin ^c,d  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF WATERLOO   (Canada)

^c INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Algorithms; Gene trees; NP hardness; Species trees

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; HEURISTIC METHODS; MAPPING; MOLECULAR BIOLOGY; MUTAGENESIS; POLYNOMIAL APPROXIMATION; VISUALIZATION;

GENE TREES; SPECIES TREES;

TREES (MATHEMATICS);

EID: 0034938644     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798343362     Document Type: Article

References (34)

1. L. ALONSO AND R. SCHOTT, Random Generation of Trees, Kluwer Academic Publishers, Boston, 1995.
2. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
3. B. DASGUPTA, X. HE, T. JIANG, M. LI, J. TROMP, AND L. ZHANG, On distance between phylogenetic trees, in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, SIAM, Philadelphia, PA, 1997, pp. 427-436.
4. O. EULENSTEIN AND M. VINGRON, On the Equivalence of Two Tree Mapping Measures, Arbeitspapiere der GMD, 936, Bonn, Germany, 1996.
5. O. EULENSTEIN, B. MIRKIN, AND M. VINGRON, Duplication-based measures of difference between gene and species trees, J. Comput. Bio., 5 (1998), pp. 135-148.
6. M. FELLOWS, M. HALLETT, C. KOROSTENSKY, AND U. STEGE, Analogs and duals of the MAST problem for sequences and trees, in Proceedings of European Symposium on Algorithms (ESA'98), Venice, Italy, 1998, Lecture Notes in Comput. Sci. 1461, Springer-Verlag, Berlin, 1998, pp. 103-114.
7. M. FELLOWS, M. HALLETT, AND U. STEGE, On the multiple gene duplication problem, in Proceedings of the 9th International Symposium on Algorithms and Computation (ISSAC'98), Taejon, Korea, 1998, Lecture Notes in Comput. Sci. 1533, Springer-Verlag, Berlin, 1998, pp. 347-356.
8. M. FARACH AND M. THORUP, Fast comparison of evolutionary trees, in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, Arlington, VA, SIAM, Philadelphia, PA, pp. 481-488.
9. J. FELSENSTEIN, Phylogenies from molecular sequences: Inference and reliability, Ann. Review Genet., 22 (1988), pp. 521-561.
10. W. FITCH, Distinguishing homologous and analogous proteins, Syst. Zool., 19 (1970), pp. 99-113.
11. W. FITCH AND E. MARGOLIASH, Construction of phylogenetic trees, Science, 155 (1967), pp. 279-284.
12. Z. GALIL AND N. MEGIDDO, Cyclic ordering is NP-complete, Theoret. Comput. Sci., 5 (1977), pp. 179-182.
13. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
14. 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, Syst. Zool., 28 (1979), pp. 132-163.
15. R. GUIGÓ, I. MUCHNIK, AND T. SMITH, Reconstruction of ancient molecular phylogeny, Mol. Phy. and Evol., 6 (1996), pp. 189-213.
16. D. HAREL AND R. B. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
17. M. LI, J. TROMP, AND L. ZHANG, Some notes on the nearest neighbor interchange distance, J. Theoret. Bio., 182 (1996), pp. 463-467.
18. B. MIRKIN, I. MUCHNIK, AND T. SMITH, A biologically meaningful model for comparing molecular phylogenies, J. Comput. Bio., 2 (1995), pp. 493-507.
19. G.W. MOORE, M. GOODMAN, AND J. BARNABAS, An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets, J. Theoret. Bio., 38 (1973), pp. 423-457.
20. M. NEI, Molecular Evolutionary Genetics, Columbia University Press, New York, 1987.
21. J. E. NEIGEL AND J. C. AVISE, Phylogenetic relationship of mitochondrial DNA under various demographic models of speciation, in Evolutionary Processes and Theory, Academic Press, Orlando, FL, 1986, pp. 515-534.
22. S. OHNO, Evolution by Gene Duplication, Springer-Verlag, Berlin, 1970.
23. R. PAGE, Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas, Syst. Bio., 43 (1994), pp. 58-77.
24. R. PAGE AND M. CHARLESTON, From gene to organismal phylogeny: Reconciled trees and the gene tree/species tree problem, Mol. Phy. and Evol., 7 (1997), pp. 231-240.
25. P. PAMILO AND M. NEI, Relationship between gene trees and species trees, Mol. Bio. Evol., 5 (1988), pp. 568-583.
26. J. L. RÉMY, Un procédé itératif de dénombrement d'arbres binaires et son application á leur génération aléatoire, R.A.I.R.O. Informatique Théorique, 19 (1985), pp. 179-195.
27. D. F. ROBINSON, Comparison of labeled trees with valency trees, J. Combin. Theory Ser. B, 11 (1971), pp. 105-119.
28. B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
29. M. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9 (1992), pp. 91-116.
30. D. SWOFFORD AND G. OLSEN, Phylogeny reconstruction, in Molecular Systematics, D. M. Hillis et al., eds., Sinauer Associates, Sunderland, MA, 1990, pp. 411-501.
31. N. TAKAHATA, Gene genealogy in three related populations: Consistency probability between gene and population trees, Genetics, 122 (1989), pp. 957-966.
32. M. WATERMAN AND T. SMITH, On the similarity of dendrograms, J. Theoret. Bio., 73 (1978), pp. 789-800.
33. C.-I. WU, Inference of species phylogeny in relation to segregation of ancient polymorphisms, Genetics, 127 (1991), pp. 429-435.
34. L. ZHANG, On a Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies, J. Comput. Bio., 4 (1997), pp. 177-188.