Tree contractions and evolutionary trees

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1592-1616

  Kao, Ming Yang ^a  

^a Yale University   (United States)

Author keywords

Computational biology; Evolutionary trees; Minimal condensed forms; Tree contractions

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION;

COMPUTATIONAL BIOLOGY; EVOLUTIONARY TREES; TIME COMPLEXITY;

TREES (MATHEMATICS);

EID: 0032318537     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795283504     Document Type: Article

References (51)

1. K. ABRAHAMSON, N. DADOUN, D. G. KIRKPATRICK, AND T. PRZYTYCKA, A simple tree contraction algorithm, J. Algorithms, 10 (1989), pp. 287-302.
2. R. AGARWALA AND D. FERNÁNDEZ-BACA, A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed, SIAM J. Comput., 23 (1994), pp. 1216-1224.
3. A. V. AHO, D. S. HIRSCHBERG, AND J. D. ULLMAN, Bounds on the complexity of the longest common subsequence problem, J. Assoc. Comput. Mach., 23 (1976), pp. 1-12.
4. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
5. A. V. AHO, Y. SAVIG, T. G. SZYMANSKI, AND J. D. ULLMAN, Inferring a tree from the lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput., 10 (1981), pp. 405-421.
6. A. APOSTOLICO AND C. GUERRA, The longest common subsequence problem revisited, Algorithmica, 2 (1987), pp. 315-336.
7. H. L. BODLAENDER, M. R. FELLOWS, AND T. J. WARNOW, Two strikes against perfect phylogeny, in Lecture Notes in Computer Science 623: Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Springer-Verlag, New York, 1992, pp. 273-283.
8. R. COLE AND R. HARIHARAN, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 323-332.
9. T. H. CORMEN, C. L. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1991.
10. W. H. E. DAY AND D. SANKOFF, Computational complexity of inferring phylogenies from chromosome inversion data, J. Theoret. Biology, 124 (1987), pp. 213-218.
11. S. DRESS AND M. STEEL, Convex tree realizations of partitions, Appl. Math. Lett., 5 (1992), pp. 3-6.
12. M. FARACH, S. KANNAN, AND T. WARNOW, A robust model for finding optimal evolutionary trees, Algorithmica, 13 (1995), pp. 155-179.
13. M. FARACH, T. M. PRZYTYCKA, AND M. THORUP, Computing the agreement of trees with bounded degrees, in Lecture Notes in Computer Science 979: Proceedings of the Third Annual European Symposium on Algorithms, P. Spirakis, ed., Springer-Verlag, New York, 1995, pp. 381-393.
14. M. FARACH AND M. THORUP, Fast comparison of evolutionary trees (extended abstract), in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 481-488.
15. M. FARACH AND M. THORUP, Optimal evolutionary tree comparison by sparse dynamic programming (extended abstract), in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 770-779.
16. J. FELSENSTEIN, Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, 57 (1982), pp. 379-404.
17. J. FELSENSTEIN, Inferring evolutionary trees from DNA sequences, in Statistical Analysis of DNA Sequence Data, B. Weir, ed., Marcel Dekker, New York, 1983, pp. 133-150.
18. J. FELSENSTEIN, Phylogenies from molecular sequences: Inference and reliability, Ann. Rev. Genetics, 22 (1988), pp. 521-565.
19. C. R. FINDEN AND A. D. GORDON, Obtaining common pruned trees, J. Classification, 2 (1985), pp. 255-276.
20. A. FRIDAY, Quantitative aspects of the estimation of evolutionary trees, Folia Primatologica, 53 (1989), pp. 221-234.
21. H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for network problems, SIAM J. Comput., 18 (1989), pp. 1013-1036.
22. H. GAZIT, G. L. MILLER, AND S. H. TENG, Optimal tree contraction in the EREW model, in Concurrent Computations: Algorithms, Architecture, and Technology, S. T. and B.W. Dickinson and S. Schwartz, eds., Plenum, New York, 1988, pp. 139-156.
23. R. N. GOLDBERG, Minimal string difference encodings, J. Algorithms, 3 (1982), pp. 147-156.
24. D. GUSFIELD, Efficient algorithms for inferring evolutionary trees, Networks, 21 (1991), pp. 19-28.
25. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
26. J. J. HEIN, An optimal algorithm to reconstruct trees from additive distance data, Bull. Math. Biology, 51 (1989), pp. 597-603.
27. M. D. HENDY, The relationship between simple evolutionary tree models and observable sequence data, Systematic Zoology, 38 (1989), pp. 310-321.
28. M. D. HENDY AND D. PENNY, Branch and bound algorithms to determine minimal evolutionary trees, Math. Biosciences, 59 (1982), pp. 277-290.
29. D. S. HIRSCHBERG, A linear space algorithm for computing maximal common subsequences, Comm. Assoc. Comput. Mach., 18 (1975), pp. 341-343.
30. D. S. HIRSCHBERG, Algorithms for the longest common subsequence problem, J. Assoc. Comput. Mach., 24 (1977), pp. 664-675.
31. D. S. HIRSCHBERG, An information theoretic lower bound for the longest common subsequence problem, Inform. Proc. Lett., 7 (1978), pp. 40-41.
32. J. W. HUNT AND T. G. SZYMANSKI, A fast algorithm for computing longest common subsequences, Comm. Assoc. Comput. Mach., 20 (1977), pp. 350-353.
33. T. JIANG, E. L. LAWLER, AND L. WANG, Aligning sequences via an evolutionary tree: Complexity and approximation, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 760-769.
34. S. K. KANNAN, B. L. LAWLER, AND T. J. WARNOW, Determining the evolutionary tree using experiments, J. Algorithms, 21 (1996), pp. 26-50.
35. S. K. KANNAN AND T. J. WARNOW, Inferring evolutionary history from DNA sequences, SIAM J. Comput., 23 (1994), pp. 713-737.
36. D. KESELMAN AND A. AMIR, Maximum agreement subtree in a set of evolutionary trees - Metrics and efficient algorithms, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 758-769;
37. SIAM J. Comput., 26 (1997), pp. 1656-1669.
38. L. C. KLOTZ AND R. L. BLANKEN, A practical method for calculating evolutionary trees from sequence data, J. Theoretical Biology, 91 (1981), pp. 261-272.
39. S. R. KOSARAJU AND A. L. DELCHER, Optimal parallel evaluation of tree-structured computations by raking, in Lecture Notes in Computer Science 319: VLSI Algorithms and Architectures, the 3rd Aegean Workshop on Computing, J. H. Reif, ed., Springer-Verlag, New York, 1988, pp. 101-110.
40. E. KUBICKA, G. KUBICKI, AND F. MCMORRIS, An algorithm to find agreement subtrees, J. Classification, 12 (1995), pp. 91-99.
41. G. L. MILLER AND J. H. REIF, Parallel tree contraction, part 1: Fundamentals, in Advances in Computing Research: Randomness and Computation, Vol. 5, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 47-72.
42. G. L. MILLER AND J. H. REIF, Parallel tree contraction part 2: Further applications, SIAM J. Comput., 20 (1991), pp. 1128-1147.
43. J. B. ORLIN AND R. K. AHUJA, New scaling algorithms for the assignment and minimum mean cycle problems, Math. Programming, 54 (1992), pp. 41-56.
44. D. PENNY AND M. HENDY, Estimating the reliability of evolutionary trees, Molecular Biology and Evolution, 3 (1986), pp. 403-417.
45. A. RZHETSKY AND M. NEI, A simple method for estimating and testing minimum-evolution trees, Molecular Biology and Evolution, 9 (1992), pp. 945-967.
46. B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
47. M. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9 (1992), pp. 91-116.
48. M. STEEL AND T. WARNOW, Kaikoura tree theorems: Computing the maximum agreement subtree, Inform. Process. Lett., 48 (1993), pp. 77-82.
49. L. WANG, T. JIANG, AND E. LAWLER, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica, 16 (1996), pp. 302-315.
50. T. J. WARNOW, Tree compatibility and inferring evolutionary history, J. Algorithms, 16 (1994), pp. 388-407.
51. C. K. WONG AND A. K. CHANDRA, Bounds for the string editing problem, J. Assoc. Comput. Mach., 23 (1976), pp. 13-16.