On the linear-cost subtree-transfer distance between phylogenetic trees

Algorithmica (New York)

Volumn 25, Issue 2-3, 1999, Pages 176-195

  DasGupta, B ^a   He, X ^b   Jiang, T ^c   Li, M ^d   Tromp, J ^e  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

^c MCMASTER UNIVERSITY   (Canada)

^d UNIVERSITY OF WATERLOO   (Canada)

^e CWI   (Netherlands)

Author keywords

Approximation algorithms; Evolutionary trees; Lower bounds

Indexed keywords

EID: 0003589460     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008273     Document Type: Article

References (26)

1. D. Barry and J. A. Hartigan, Statistical analysis of hominoid molecular evolution, Statist. Sci., 2 (1987), 191-210.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.
3. B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, On distances between phylogenetic trees, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 427-436.
4. B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, On computing the nearest neighbor interchange distance, Preprint, 1997.
5. W. H. E. Day, Optimal algorithms for comparing trees with labeled leaves, J. Classification, 2 (1985), 7-28.
6. A. W. F. Edwards and L. L. Cavalli-Sforza, The reconstruction of evolution, Ann. Human Genetics, 27 (1964), 105. (Also in Heredity, 18, 553.)
7. A. W. F. Edwards and L. L. Cavalli-Sforza, The reconstruction of evolution, Ann. Human Genetics, 27 (1964), 105. (Also in Heredity, 18, 553.)
8. J. Felsenstein, Evolutionary trees for DNA sequences: a maximum likelihood approach. J. Mol. Evol., 17 (1981), 368-376.
9. J. Felsenstein, Personal communication, 1996.
10. W. M. Fitch, Toward defining the course of evolution: minimum change for a specified tree topology, Syst. Zool., 20 (1971), 406-416.
11. W. M. Fitch and E. Margoliash, Construction of phylogenetic trees, Science, 155 (1967), 279-284.
12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
13. J. Hein, Reconstructing evolution of sequences subject to recombination using parsimony, Math. Biosci., 98 (1990), 185-200.
14. J. Hein, A heuristic method to reconstruct the history of sequences subject to recombination, J. Mol. Evol., 36 (1993), 396-405.
15. J. Hein, Personal email communication, 1996.
16. J. Hein, T. Jiang, L. Wang, and K. Zhang, On the complexity of comparing evolutionary trees, Discrete Appl. Math., 71 (1996), 153-169.
17. M. Kuhner and J. Felsenstein, A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol. 11(3) (1994), 459-468.
18. W. J. Le Quesne, The uniquely evolved character concept and its cladistic application, Syst. Zool., 23 (1974), 513-517.
19. M. Li, J. Tromp, and L. Zhang, Some notes on the nearest neighbor interchange distance, J. Theoret. Biol., 182 (1996), 463-467.
20. 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. Biol., 38 (1973), 423-457.
21. D. F. Robinson, Comparison of labeled trees with valency three, J. Combin. Theory Ser. B, 11 (1971), 105-119.
22. N. Saitou and M. Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees, Mol. Biol. Evol., 4 (1987), 406-425.
23. D. Sankoff, Minimal mutation trees of sequences, SIAM J. Appl. Math., 28 (1975), 35-42.
24. D. Sleator, R. Tarjan, and W. Thurston, Short encodings of evolving structures, SIAM J. Discrete Math., 5 (1992), 428-150.
25. A. von Haseler and G. A. Churchill, Network models for sequence evolution, J. Mol. Evol., 37 (1993), 77-85.
26. M. S. Waterman and T. F. Smith, On the similarity of dendrograms, J. Theoret. Biol., 73 (1978), 789-800.