Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 306-322

  Csurös, Miklós ^a   Kao, Ming Yang ^a  

^a Yale University   (United States)

Author keywords

Computational learning; Evolutionary trees; Harmonic greedy triplets; The Jukes Cantor model of evolution

Indexed keywords

COMPUTATIONAL COMPLEXITY; LEARNING ALGORITHMS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; TREES (MATHEMATICS);

EVOLUTIONARY TREES;

COMPUTATIONAL METHODS;

EID: 0036214723     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970037905X     Document Type: Article

References (22)

1. R. AGARWALA, V. BAFNA, M. FARACH, M. PATERSON, AND M. THORUP, On the approximability of numerical taxonomy (fitting distances by tree metrics), SIAM J. Comput., 28 (1999), pp. 1073-1085.
2. A. AMBAINIS, R. DESPER, M. FARACH, AND S. KANNAN, Nearly tight bounds on the learnability of evolution, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Santa Fe, NM, 1997, pp. 524-533.
3. K. ATTESON, The performance of neighbor-joining algorithms of phylogeny reconstruction, Algorithmica, 25 (1999), pp. 251-278.
4. M. CRYAN, L. A. GOLDBERG, AND P. W. GOLDBERG, Evolutionary trees can be learned in polynomial time in the two-state general Markov-model, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Palo Alto, CA, 1998, pp. 436-445.
5. M. CSURÖS AND M. Y. KAO, Recovering evolutionary trees through harmonic greedy triplets, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 261-270.
6. M. CSUROS, Reconstructing Phylogenies in Markov Models of Evolution, Ph.D. thesis, Yale University, 2000.
7. W. H. E. DAY, Computational complexity of inferring phylogenies from dissimilarity matrices, Bulletin of Mathematical Biology, 49 (1997), pp. 461-467.
8. W. H. E. DAY, D. S. JOHNSON, AND D. SANKOFF, The computational complexity of inferring rooted phylogenies by parsimony, Math. Biosci., 81 (1986), pp. 33-42.
9. D.-Z. DU, Y.-J. ZHANG, AND Q. FENG, On better heuristic for Euclidean Steiner minimum trees (extended abstract), in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, San Juan, Puerto Rico, 1991, pp. 431-439.
10. P. L. ERDOS, M. A. STEEL, L. A. SZÉKELY, AND T. J. WARNOW, A few logs suffice to build (almost) all trees. I, Random Structures Algorithms, 14 (1999), pp. 153-184.
11. P. L. ERDOS, M. A. STEEL, L. A. SZÉKELY, AND T. J. WARNOW, A few logs suffice to build (almost) all trees. II, Theoret. Comput. Sci., 221 (1999), pp. 77-118.
12. M. FARACH AND S. KANNAN, Efficient algorithms for inverting evolution, J. ACM, 46 (1999), pp. 437-449.
13. J. FELSENSTEIN, Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, 57 (1982), pp. 379-404.
14. J. FELSENSTEIN, Inferring evolutionary trees from DNA sequences, in Statistical Analysis of DNA Sequence Data, B. Weir, ed., Dekker, New York, 1983, pp. 133-150.
15. J. FELSENSTEIN, Statistical inference of phylogenies, J. Roy. Statist. Soc. Ser. A, 146 (1983), pp. 246-272.
16. D. GUSFIELD, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, 1997.
17. W. HOEFFDING, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc., 58 (1963), pp. 13-30.
18. D. HUSON, S. NETTLES, AND T. WARNOW, Disk-covering, a fast converging method for phylogenetic tree reconstruction, Journal of Computational Biology, 6 (1999), pp. 369-386.
19. M. J. KEARKS, Y. MANSOUR, D. RON, R. RUBINFELD, R. E. SCHAPIRE, AND L. SELLIE, On the learnability of discrete distributions (extended abstract), in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM, Montreal, Quebec, Canada, 1994, pp. 273-282.
20. M. E. SIDDALL, Success of parsimony in the four-taxon case: Long-branch repulsion by likelihood in the Farris zone, Cladistics, 14 (1998), pp. 209-220.
21. M. STEEL, Recovering a tree from the leaf colourations it generates under a Markov model, Appl. Math. Lett., 7 (1994), pp. 19-23.
22. D. L. SWOFFORD, G. J. OLSEN, P. J. WADDELL, AND D. M. HILLIS, Phylogenetic inference, in Molecular Systematics, 2nd ed., D. M. Hillis, C. Moritz, and B. K. Mable, eds., Sinauer Associates, Sunderland, MA, 1996, pp. 407-514.