Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

Random Structures and Algorithms

Volumn 40, Issue 3, 2012, Pages 350-384

  Gronau, Ilan ^a   Moran, Shlomo ^a   Snir, Sagi ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Adaptive fast converging; Fast converging; Optimal time algorithms; Phylogenetic reconstruction

Indexed keywords

EID: 84858438142     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20372     Document Type: Article

References (34)

1. K. Atteson, The performance of neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25 (1999), 251-278.
2. P. Buneman, The recovery of trees from measures of dissimilarity, Mathematics in the Archeological and Historical Sciences, F. Hodson, D. Kendall, P. Tautu (Editors), Edinburgh University Press, 1971, pp. 387-395.
3. J. Cavender, Taxonomy with confidence, Math Biosci 40 (1978), 271-280.
4. T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to algorithms, 2nd edition, MITP, 2001.
5. M. Cryan, L. Goldberg, P. Goldberg, Evolutionary trees can be learned in polynomial time in the two-state general markov model, SIAM J Comput 31 (2001), 375-397.
6. M. Csürös, Fast recovery of evolutionary trees with thousands of nodes, J Comput Biol 9 (2002), 277-297.
7. J. Culberson, P. Rudnicki, A fast algorithm for constructing trees from distance matrices, Inform Process Lett 30 (1989), 215-220.
8. C. Daskalakis, C. Hill, A. Jaffe, R. Mihaescu, E. Mossel, S. Rao, Maximal accurate forests from distance matrices, In RECOMB '06: Proceedings of the Tenth Annual International Conference on Computational Molecular Biology, Venice, Italy, 2006, pp. 281-295.
9. C. Daskalakis, E. Mossel, S. Roch, Optimal phylogenetic reconstruction, In STOC '06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, Seattle, WA, 2006, pp. 159-168.
10. C. Daskalakis, E. Mossel, S. Roch, Phylogenies without branch bounds: Contracting the short, pruning the deep, In RECOMB '09: Proceedings of the Thirteenth Annual International Conference on Computational Molecular Biology, Tucson, AZ, 2009, pp. 451-465.
11. P. L. Erdös, M. A. Steel, L. A. Szekely, T. J. Warnow, A few logs suffice to build (almost) all trees (I), Random Struct Algorithm 14 (1999), 153-184.
12. P. L. Erdös, M. A. Steel, L. A. Szekely, T. J. Warnow, A few logs suffice to build (almost) all trees (II), Theoret Comput Sci 221 (1999), 77-118.
13. J. Farris, A probability model for inferring evolutionary trees, System Zool 22 (1973), 250-256.
14. J. Felsenstein, Inferring phylogenies, Sinauer Associated, Inc., Sunderland, MA, 2004.
15. I. Gronau, S. Moran, S. Snir, Fast and reliable reconstruction of phylogenetic trees with very short edges, In SODA: ACM-SIAM Symposium on Discrete Algorithms, San Francisco, AZ, 2008.
16. I. Gronau, S. Moran, I. Yavneh, Towards optimal distance functions for stochastic substitution models, J Theor Biol 260 (2009), 294-307.
17. D. Huson, S. Nettles, T. Warnow, Disk-Covering, a fast-converging method for phylogenetic tree reconstruction, J Comput Biol 6 (1999), 369-386.
18. T. Jukes, C. Cantor, Evolution of protein molecules, Mammalian protein metabolism, H. Munro (Editor), Academic Press, New York, 1969, pp. 21-132.
19. M. Kimura, A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences, J Mol Evol 16 (1980), 111-120.
20. V. King, L. Zhang, Y. Zhou, On the complexity of distance-based evolutionary tree reconstruction, In SODA: ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 444-453.
21. M. Lacey, J. Chang, A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences, Math Biosci 199 (2006), 188-215.
22. R. Mihaescu, C. Hill, S. Rao, Fast phylogeny reconstruction through learning of ancestral sequences, 2008.
23. B. Moret, K. St. John, T. Warnow, Absolute convergence: true trees from short sequences, In SODA: ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 186-195.
24. E. Mossel, Phase transitions in phylogeny, Trans Am Math Soc 356 (2004), 2379-2404.
25. E. Mossel, Distorted metrics on trees and phylogenetic forests, IEEE/ACM Trans Comput Biol Bioinform 4 (2007), 108-116.
26. E. Mossel, M. Steel, How much can evolved characters tell us about the tree that generated them?, Mathematics of evolution and phylogeny, Chapter 14, O. Gascuel (Editor), Oxford University Press, 2005, pp. 384-412.
27. J. Neymann, Molecular studies of evolution: A source of novel statistical problems, Statistical decision theory and related topics, S. Gupta, Y. Jackel (Editors), Academic Press, New York, 1971, pp. 1-27.
28. F. Robinson, R. Foulds, Comparison of phylogenetic trees, Math Biosci 53 (1981), 131-147.
29. S. Roch, Sequence length requirement of distance-based phylogeny reconstruction: Breaking the polynomial barrier, In IEEE Symposium on Foundations of Computer Science (FOCS), Philadelphia, PA, 2008, pp. 729-738.
30. N. Saitou, M. Nei, The neighbor-joining method: A new method for reconstructing phylogenetic trees, Mol Biol Evol 4 (1987), 406-425.
31. M. Steel, L. Szekely, Inverting random functions II: Explicit bounds for discrete maximum likelihood estimation, with applications, SIAM J Discrete Math 15 (2002), 562-575.
32. L. Wasserman, All of statistics, Springer, New York, 2004.
33. M. Waterman, T. Smith, M. Singh, W. Beyer, Additive evolutionary trees, J Theor Biol 64 (1977), 199-213.
34. K. Zaretskii, Constructing a tree on the basis of a set of distances between the hanging vertices, Uspekhi Mat Nauk 20 (1965), 90-92, [in Russian].