Phylogenies without branch bounds: Contracting the short, pruning the deep

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 2, 2011, Pages 872-893

  Daskalakis, Constantinos ^a   Mossel, Elchanan ^b   Roch, Sebastien ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Additive metrics; Forests; Markov models; Phytogenics

Indexed keywords

BRANCH LENGTH; DISTANCE-BASED; FORESTS; INFERENCE TECHNIQUES; MARKOV MODELS; PHYLOGENETIC RECONSTRUCTION; PHYTOGENICS; POLYNOMIAL-TIME; SEQUENCE LENGTHS;

ALGORITHMS; MARKOV PROCESSES; PLANT EXTRACTS; POLYNOMIAL APPROXIMATION;

INFERENCE ENGINES;

EID: 79960608276     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/09075576X     Document Type: Article

References (35)

1. H.-J. BANDELT AND A. DRESS, Reconstructing the shape of a tree from observed dissimilarity data, Adv. in Appl. Math., 7 (1986), pp. 309-343.
2. D. BARRY AND J. A. HARTIGAN, Statistical analysis of hominoid molecular evolution, Statist. Sci., 2 (1987), pp. 191-210, with comments by Stephen Portnoy and Joseph Felsenstein and a reply by the authors.
3. P. BUNEMAN, The recovery of trees from measures of dissimilarity, in Mathematics in the Archae-logical and Historical Sciences, Edinburgh University Press, Edinburgh, Scotland, 1971, pp. 187-395.
4. F. D. CICCARELLI, T. DOERKS, C. VON MERING, C. J. CREEVEY, B. SNEL, AND P. BORK, Toward automatic reconstruction of a highly resolved tree of life, Science, 311 (2006), pp. 1283-1287. (Pubitemid 43334717)
5. J. T. CHANG, Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency, Math. Biosci., 137 (1996), pp. 51-73. (Pubitemid 26307662)
6. M. CSURÖS AND M.-Y. KAO, Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets, SIAM J. Comput., 31 (2001), pp. 306-322. (Pubitemid 33779792)
7. M. CSURÖS, Fast recovery of evolutionary trees with thousands of nodes, J. Comput. Biol., 9 (2002), pp. 277-297. (Pubitemid 34548265)
8. B. CHOR AND T. TULLER, Finding a maximum likelihood tree is hard, J. ACM, 53 (2006), pp. 722-744. (Pubitemid 44879347)
9. W. H. E. DAY, Computational complexity of inferring phylogenies from dissimilarity matrices, Bull. Math. Biol., 49 (1987), pp. 461-467.
10. C. DASKALAKIS, C. HILL, A. JAFFE, R. MIHAESCU, E. MOSSEL, AND S. RAO, Maximal accurate forests from distance matrices, in Research in Computational Molecular Biology, Lecture Notes in Comput. Sci. 3909, Springer, Berlin, 2009.
11. C. DASKALAKIS, E. MOSSEL, AND S. ROCH, Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture, Probab. Theory Related Fields, 2009; available only online at http://www.springerlink.com/ content/k76630287587433x/fulltext.pdf.
12. C. DASKALAKIS, E. MOSSEL, AND S. ROCH, Phylogenies without branch bounds: Contracting the short, pruning the deep, in Research in Computational Molecular Biology, Lecture Notes in Comput. Sci. 5541, Springer, Berlin, 2009, pp. 451-465.
13. W. H. E. DAY AND D. SANKOFF, Computational complexity of inferring phylogenies by compatibility, Syst. Zool., 35 (1986), pp. 224-229.
14. P. L. ERDÖS, M. A. STEEL, L. A. SZÉKELY, AND T. A. WARNOW, A few logs suffice to build (almost) all trees (Part 1), Random Structures Algorithms, 14 (1999), pp. 153-184.
15. P. L. ERDÖS, M. A. STEEL, L. A. SZÉKELY, AND T. A. WARNOW, A few logs suffice to build (almost) all trees (Part 2), Theoret. Comput. Sci., 221 (1999), pp. 77-118. (Pubitemid 129608962)
16. J. FELSENSTEIN, Cases in which parsimony or compatibility methods will be positively misleading, Syst. Biol., 27 (1978), pp. 401-410.
17. J. FELSENSTEIN, Inferring Phylogenies, Sinauer, Sunderland, MA, 2004.
18. R. L. GRAHAM AND L. R. FOULDS, Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time, Math. Biosci., 60 (1982), pp. 133-142. (Pubitemid 13089258)
19. I. GRONAU, S. MORAN, AND S. SNIR, Fast and reliable reconstruction of phylogenetic trees with very short edges, in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2008, pp. 379-388.
20. D. H. HUSON, S. H. NETTLES, AND T. J. WARNOW, Disk-covering, a fast-converging method for phylogenetic tree reconstruction, J. Comput. Biol., 6 (1999), pp. 369-386.
21. V. KING, L. ZHANG, AND Y. ZHOU, On the complexity of distance-based evolutionary tree reconstruction, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2003, pp. 444-453.
22. J. A. LAKE, Reconstructing Evolutionary Trees from DNA and Protein Sequences: Paralinear Distances, Proc. Natl. Acad. Sci. USA, 91 (1994), pp. 1455-1459.
23. M. R. LACEY AND J. T. CHANG, A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences, Math. Biosci., 199 (2006), pp. 188-215. (Pubitemid 43197780)
24. P. J. LOCKHART, M. A. STEEL, M. D. HENDY, AND D. PENNY, Recovering evolutionary trees under a more realistic model of sequence, Mol. Biol. Evol., 11 (1994), pp. 605-612. (Pubitemid 24198536)
25. C. A. MEACHAM, A manual method for character compatibility analysis, Taxon, 30 (1981), pp. 591-600.
26. R. MIHAESCU, C. HILL, AND S. RAO, Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences, ArXiv: 0812.1587, 2008.
27. E. MOSSEL, Distorted metrics on trees and phylogenetic forests, IEEE/ACM Trans. Comput. Bio. Bioinform., 4 (2007), pp. 108-116. (Pubitemid 46375820)
28. E. MOSSEL AND S. ROCH, Learning nonsingular phylogenies and hidden Markov models, Ann. Appl. Probab., 16 (2006), pp. 583-614. (Pubitemid 44196526)
29. H. PHILIPPE AND J. LAURENT, How good are deep phylogenetic trees?, Curr. Opinion Genet. Dev., 8 (1998), pp. 616-623. (Pubitemid 28558522)
30. S. ROCH, A short proof that phylogenetic tree reconstruction by maximum likelihood is hard, IEEE/ACM Trans. Comput. Biol. Bioinform., 3 (2006), pp. 92-94. (Pubitemid 43269830)
31. N. SAITOU AND M. NEI, The neighbor-joining method: A new method for reconstructing phyloge-netic trees, Mol. Biol. Evol., 4 (1987), pp. 406-425.
32. M. A. STEEL AND L. A. SZÉKELY, Inverting random functions, Ann. Comb., 3 (1999), pp. 103-113.
33. M. A. STEEL AND L. A. SZÉKELY, Inverting random functions. II. Explicit bounds for discrete maximum likelihood estimation, with applications, SIAM J. Discrete Math., 15 (2002), pp. 562-575. (Pubitemid 35355426)
34. C. SEMPLE AND M. STEEL, Phylogenetics, Math. Appl. (Oxford) 22, Oxford University Press, Oxford, UK, 2003.
35. M. STEEL, Recovering a tree from the leaf colourations it generates under a Markov model, Appl. Math. Lett., 7 (1994), pp. 19-23.