A stochastic local search algorithm for distance-based phylogeny reconstruction

Molecular Biology and Evolution

Volumn 27, Issue 11, 2010, Pages 2587-2595

  Tria, Francesca ^a   Caglioti, Emanuele ^b   Loreto, Vittorio ^a,b   Pagnani, Andrea ^a  

^a ISI FOUNDATION   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

noise and horizontal transfer; phylogeny; stochastic methods; trees

Indexed keywords

ALGORITHM; ARTICLE; GENE MUTATION; GENETIC DISTANCE; HORIZONTAL GENE TRANSFER; NOISE; PHYLOGENY; STOCHASTIC MODEL; TAXONOMIC IDENTIFICATION;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; GENE TRANSFER, HORIZONTAL; MUTATION; PHYLOGENY; STOCHASTIC PROCESSES;

EID: 77958142872     PISSN: 07374038     EISSN: 15371719     Source Type: Journal    
DOI: 10.1093/molbev/msq154     Document Type: Article

References (32)

1. Atteson K. 1997. The performance of neighbor-joining algorithms of phylogeny reconstruction. In: Jiang T, Lee D, editors. Lecture Notes in Computer Science. 1276. Berlin, Germany:Springer-Verlag. p. 101-110.
2. Avise JC. 2000. Phylogeography: the history and formation of species. Cambridge (MA): Harvard University Press.
3. Bordewich M, Gascuel O, Huber KT, Moulton V. 2009. Consistency of topological moves based on the balanced minimum evolution principle ofphylogenetic inference. IEEE/ACM Trans Comput Biol Bioinform. 6(1):110-117.
4. Bruno WJ, Socci ND, Alpern AL 2000. Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction. Mol Biol Evol. 17:189-197.
5. Buneman P. 1971. The recovery oftrees from measures ofdissimilarity. In: Hudson FR, Kendall DG, Tautu P, editors. Mathematics in archeological and historical sciences. Edinburgh (UK): Edinburgh University Press. p. 387-395.
6. Buneman P. 1974. A note on the metric properties oftrees. J Comb. Theory Ser B. 17:48-50.
7. Cavalli-Sforza LL, Edwards AWF. 1967. Phylogenetic analysis: models and estimation procedures. Am J Hum Genet. 19:233-257.
8. Desper R, Gascuel O. 2002. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. J Comput Biol. 9:687-705.
9. Doolittle WF, Nesbo CL, Bapteste E, Zhaxybayeva O. 2008. Lateralgene transfer. In: Pagel M, Pomiankowski A, editors. Evolutionary genomics andproteonomics. Sunderland (MA): Sinauer. p. 45-79.
10. Erdös PL, Rice K, Szekely LA, Warnow TJ, Steel M, Warnow YJ. 1998. The short quartet method. In: Proceedings of International Congress on Automata, Languages and Programming, ICALP'98. July 13-17, 1998. Aalborg, Denmark. Springer. Lecture Notes in Computer Science.
11. Felsenstein J. 2004. Inferringphylogenies. Sunderland (MA): Sinauer Associates Inc.
12. Fitch WM, Margoliash E. 1967. Construction of phylogenetic trees. Science 155:279-284.
13. Gascuel O, editor. 2007. Mathematics of evolution and phylogeny. Oxford (UK): Oxford University Press.
14. Gascuel O, Steel M. 2006. Neighbor-joining revealed. Mol Biol Evol. 23:1997-2000.
15. Gray RD, Atkinson QD. 2003. Language-tree divergence times support the Anatolian theory of Indo-European origin. Nature 426: 435-439.
16. Grenfell BT, Pybus OG, Gog JR, Wood JLN, Daly JM, Mumford JA, Holmes EC 2004. Unifying the epidemiological and evolutionary dynamics ofpathogens. Science 303:327-332.
17. Gusfield D. 1997. Algorithms on strings, trees, and sequences: computer science and computational biology. New York: Cambridge University Press.
18. Hoos HH, Stützle T, 2005. Stochastic Local Search: Foundations and Application. Amsterdam, The Netherlands: Morgan Kaufmann, Elsevier.
19. Huelsenbeck JP, Ronquist F. 2001. MRBAYES: Bayesian inference of phylogenetic trees. Bioinformmatics 17(8):754-755.
20. Kimura M. 1980. A simple model for estimating evolutionary rates of base substitutionsthrough comparative studies ofnucleotide sequences. JMol Evol. 16:111-120.
21. Kirkpatrick SJ, Gelatt CD, Vecchi MP. 1983. Optimization by simulated annealing. Science 220:671-680.
22. Lazer D, Pentland A, Adamic L, et al. (15 co-authors). 2009. Social science: computational social science. Science 323:721-723.
23. Liu K, Raghavan S, Nelesen S, Linder CR, Warnow T. 2009. Rapid and accurate large-scale coestimation ofsequence alignments and phylogenetic trees. Science 324:1561-1564.
24. Mihaescu R, Levy D, Pachter L 2007. Why neighbor-joining works. Algorithmica 54:1-24.
25. Pauplin Y. 2000. Direct calculation of a tree length using a distance matrix. JMol Evol. 51:41-47.
26. Pybus OG, Rambaut A. 2009. Evolutionary analysis of the dynamics of viral infectious disease. Nat Rev Genet. 10:540-550.
27. Ragoussis J. 2009. Genotyping technologies forgenetic research. Annu Rev Genomics Hum Genet. 10:117-133.
28. Renfrew C, McMahon A, Trask L 2000. Time depth in historical linguistics. Cambridge (UK): The McDonald Institute for Archeological Research.
29. Robinson D, Foulds L 1981.Comparison ofphylogenetic trees. Math Biosci. 53:131-147.
30. Saitou N, Nei M. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol. 4:406-425.
31. Simonson AB, Servin JA, Skophammer RG, Herbold CW, Rivera MC, Lake JA. 2005. Decoding the genomic tree of life. Proc Natl Acad Sci US A. 102:6608-6613.
32. Snir S, Warnow T, Rao S. 2008. Short quartet puzzling: a new quartetbased phylogeny reconstruction algorithm. J Comput Biol. 15: 91-103.