The minimum evolution problem: Overview and classification

Networks

Volumn 53, Issue 2, 2009, Pages 112-125

  Catanzaro, Daniele ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Computational biology; Minimum evolution; Network design; Phylogenetic estimation

Indexed keywords

BIOINFORMATICS; COMPOSITE MICROMECHANICS; GRAPH THEORY; OPTIMIZATION;

COMPUTATIONAL BIOLOGY; EDGE WEIGHTS; EVOLUTIONARY RELATIONSHIPS; MINIMUM EVOLUTION; MOLECULAR DATUM; MOLECULAR PHYLOGENETICS; NETWORK DESIGN; NP-HARD; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; PHYLOGENETIC ESTIMATION; WEIGHTED TREES;

BIOLOGY;

EID: 63049108007     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20280     Document Type: Article

References (102)

1. R. Argawala, V. Bafna, M. Farach, M. Paterson, and M. Thorup, On the approximability of numerical taxonomy (fitting distances by tree metrics), SLAM J Comput 28 (1999), 1073-1085.
2. K. Atteson, The performance of the neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25 (1999), 251-278.
3. H. Bandelt and A. Dress, Split decomposition: A new and useful approach to phylogenetic analysis of distance data, MoI Phylogenet Evol 1 (1992), 242-252.
4. J.P. Barthélemy and A. Guénoche, Trees and proximity representations, Wiley, New York, 1991.
5. W.A. Beyer, M. Stein, T. Smith, and S. Ulam, A molecular sequence metric and evolutionary trees, Math Biosci 19 (1974), 9-25.
6. A. Björck, Numerical methods for least-squares problems, SIAM, Philadelphia, PA, 1996.
7. W.J. Bruno, M.D. Socci, and A.L. Halpern, Weighted neighbor-joining: A likelihood-based approach to distance-based phylogeny reconstruction, Mol Biol Evol 17 (2000), 189-197.
8. D. Bryant and P. Waddell, Rapid evaluation of least-squares and minimum evolution criteria on phylogenetic trees, Mol Biol Evol 15 (1998), 1346-1359.
9. M. Bulmer, Use of the method of generalized least-squares in reconstructing phylogenies from sequence data, Mol Biol Evol 8 (1991), 868-883.
10. P. Buneman, "The recovery of trees from measure of dissimilarities, Archaeological and historical science," F.R. Hodson, D.G. Kendall, and P. Tautu (Editors), Edinburgh University Press, Edinburgh, UK, 1971, pp. 387-395.
11. D. Catanzaro, R. Pesenti, and M. Milinkovitch, A non-linear optimization procedure to estimate distances and instantaneous substitution rate matrices under the GTR model, Bioinformatics 22 (2006), 708-715.
12. L.L. Cavalli-Sforza and A.W.F Edwards, Analysis of human evolution, Proc XI Int Congress Genet, Pergamon Press, Oxford, UK, 1963, pp. 923-933.
13. L.L. Cavalli-Sforza and A.W.F. Edwards, Phylogenetic analysis: Models and estimation procedures, Am J Hum Genet 19(1967), 233-257.
14. R. Chakraborty, Estimation of time of divergence from phylogenetic studies, Can J CytolGenet 19 (1977), 217-223.
15. H.F. Chen and M.S. Chang, An efficient exact algorithm for the minimum ultrametric tree problem, Lecture Notes Comput Sci 3341 (2004), 282-293.
16. Y.H. Chen, C.L.L. Lu, and C.Y. Tang, On the full and bottleneck full Steiner tree problems, Lecture Notes Comput Sei 2697 (2003), 122-129.
17. B. Chor and T. Tuller, Maximum likelihood of evolutionary trees: Hardness and approximation, Bioinformatics 21 (2005), i97-i106.
18. M. Csürös, Fast recovery of evolutionary trees with thousands of nodes, J Comput Biol 9 (2002), 277-297.
19. M. Csürös and Y. Kao, Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets, SIAM J Comput 31 (2001), 306-322.
20. J. Culberson and P. Rudnicki, A fast algorithm for constructing trees from distance matrices, Inform Process Lett 30 (1989), 215-220.
21. A.E. da Silva, W.J.P. Villanueva, H. Knidel, V. Bonato, S.F. dos Reis, and F.J.V. Zuben, A multi-neighbor-joining approach for phylogenetic tree reconstruction and visualization, Genet Mol Res 4 (2005), 525-534.
22. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, B Math Biol 49 (1987), 461-467.
23. F. Denis and O. Gascuel, On the consistency of the minimum evolution principle of phylogenetic inference, Discrete Appl Math 127 (2003), 66-77.
24. R. Desper and O. Gascuel, Fast and accurate phylogeny reconstruction algorithms based on the minimum evolution principle, J Comput Biol 9 (2002), 687-705.
25. R. Desper and O. Gascuel, Theoretical foundations of the balanced minimum evolution method of phylogenetic inference and its relationship to the weighted least-squares tree fitting, Mol Biol Evol 21 (2004), 587-598.
26. A.J. Dobson, Unrooted trees for numerical taxonomy, J Appl Probab 11 (1974), 32-42.
27. P. Erixon, B. Svennblad, T. Britton, and B. Oxelman, Reliability of Bayesian posterior probabilities and bootstrap frequencies in phylogenetics, Syst Biol 52 (2003), 665-673.
28. D.P Faith, Distance methods and the approximation of most-parsimonious trees, Syst Zool 43 (1985), 312-325.
29. M. Farach, S. Kannan, and T. Warnow, A robust model for finding optimal evolutionary trees, Algorithmica 13 (1995), 155-179.
30. J.S. Farris, On the cophenetic correlation coefficient, Syst Zool 18 (1969), 279-285.
31. J.S. Farris, Estimating phylogenetic trees from distance matrices, Am Nat 106 (1972), 645-668.
32. J. Felsenstein, Cases in which parsimony or compatibility methods will be positively misleading, Syst Zool 27 (1978), 401-410.
33. J. Felsenstein, Evolutionary trees from DNA sequences: A maximum likelihood approach, J MolI Evol 17 (1981), 368-376.
34. J. Felsenstein, Distance methods for inferring phylogenies: A justification, Evolution 38 (1984), 16-24.
35. J. Felsenstein, An alternating least-squares approach to inferring phylogenies from pairwise distances, Syst Biol 46 (1997), 101-111.
36. J. Felsenstein, Inferring phylogenies, Sinauer Associates, Sunderland, MA, 2004.
37. W.M. Fitch, Rate of change of concomitantly variable codons, J Mol Evol 1 (1971), 84-96.
38. W.M. Fitch and E. Margoliash, Construction of phylogenetic trees, Sci 155 (1967), 279-284.
39. N. Galtier, Maximum-likelihood phylogenetic analysis under covarion-like model, Mol Biol Evol 18 (2001), 866-873.
40. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York, 2003.
41. O. Gascuel, BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data, Mol Biol Evol 14 (1997), 685-695.
42. O. Gascuel, "Concerning the NJ algorithm and its unweighted version," UNJ, Mathematical hierarchies and biology, B. Mirkin, F.R. McMorris, F. Roberts, and A. Rzhetsky (Editors), American Mathematical Society, Providence, RI, 1997, pp. 149-170.
43. O. Gascuel, On the optimization principle in phylogenetic analysis and the minimum evolution criterion, J Classif 19 (2000), 67-69.
44. O. Gascuel, Mathematics of evolution and phylogeny, Oxford University Press, New York, 2005.
45. O. Gascuel, D. Bryant, and F. Denis, Strengths and limitations of the minimum evolution principle, Syst Biol 50 (2001), 621-627.
46. O. Gascuel and D. Levy, A reduction algorithm for approximating a (non-metric) dissimilarity by a tree distance, J Classif 13 (1996), 129-155.
47. O. Gascuel and A. McKenzie, Performance analysis of hierarchical clustering algorithms, J Classif 21 (2004), 3-18.
48. O. Gascuel and M. Steel, Neighbor-joining revealed, Mol Biol Evol 23 (2006), 1997-2000.
49. G.H. Gonnet, C. Korostensky, and S. Benner, Evaluation measures of multiple sequence alignments, J Comput Biol 7 (2000), 261-276.
50. 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), 133-142.
51. X. Gu and W.H. Li, A general additive distance with time-reversibility and rate variation among nucleotide sites, Proc Natl Acad Sci USA 93 (1996), 4671-4676.
52. M. Hasegawa, H. Kishino, and T. Yano, Evolutionary trees from DNA sequences: A maximum likelihood approach, J Mol Evol 17 (1981), 368-376.
53. M. Hasegawa. H. Kishino, and T. Yano, Dating the human-ape splitting by a molecular clock of mitochondrial DNA, J Mol Evol 22 (1985), 160-174.
54. D.M. Hillis, Approaches for assessing phylogenetic accuracy, Syst Biol 44 (1995), 3-16.
55. L.J. Hubert and P. Arabie, Iterative projection strategies for the least-squares fitting of tree structures to proximity data, Brit J Math Stat Psy 48 (1995), 281-317.
56. J.P. Huelsenbeck, Performance of phylogenetic methods in simulation, Syst Biol 44 (1995), 17-48.
57. J.P. Huelsenbeck, Testing a covariotide model of DNA substitution, Mol Biol Evol 19 (2002), 698-707.
58. J.P. Huelsenbeck, F. Ronquist, R. Nielsen, and J.P. Boll-back, Bayesian inference of phylogeny and its impact on evolutionary biology, Sci 294 (2001), 2310-2314.
59. D. Huson, S. Nettles, and T. Warnow, Disk-covering, a fast converging method for phylogenetic tree reconstruction, J Comput Biol 6 (1999), 369-386.
60. T.H. Jukes and C. Cantor, "Evolution of protein molecules," Mammalian protein metabolism, H.N. Munro (Editor), Academic Press, New York, 1969, pp. 21-123.
61. K.K. Kidd and L.A. Sgaramella-Zonta, Phylogenetic analysis: Concepts and methods, Am J Hum Genet 23 (1971), 235-252.
62. 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.
63. V. King, L. Zhang, and Y. Zhou, On the complexity of distance-based evolutionary tree reconstruction, Proc Fourteenth Ann ACM-SIAM Symp Discr Algorithms, SIAM, Philadelphia, PA, 2003, pp. 444-453.
64. C. Korostensky and G.H. Gonnet, Using traveling salesman problem algorithms for evolutionary tree construction, Bioinformatics 16 (2000), 619-627.
65. M.K. Kuhner and J. Felsenstein, A simulation comparison of phylogeny algorithms under equal and unequal rates, Mol Biol Evol 11 (1994), 584-593.
66. S. Kumar, A stepwise algorithm for finding minimum evolution evolutionary trees, Mol Biol Evol 13 (1996), 584-593.
67. C. Lanave, G. Preparata, C. Saccone, and G. Serio, A new method for calculating evolutionary substitution rates, J Mol Evol 20 (1984), 86-93.
68. B. Larget and D.L. Simon, Markov chain monte carlo algorithms for the Bayesian analysis of phylogenetic trees, Mol Biol Evol 16 (1999), 750-759.
69. W.H. Li and A. Zharkikh, Statistical tests of DNA phylogenies, Syst Biol 44 (1995), 49-63.
70. P. Lopez, D. Casane, and H. Philippe, Heterotachy : An important process of protein evolution, Mol Biol Evol 19 (2002), 1-7.
71. C.L. Lu, C.Y. Tang, and R.C.T. Lee, The full Steiner tree problem, Theor Comput Sci 306 (2003), 55-67.
72. V. Makarenkov and F.J. Lapointe, A weighted least-squares approach for inferring phylogenies from incomplete distance matrices, Bioinformatics 20 (2004), 2113-2121.
73. V. Makarenkov and B. Leclerc, "Circular orders of tree metrics and their uses for the reconstruction and fitting of phylogenetic trees," Mathematical hierarchies and biology, B. Mirkin, F.R. McMorris, F. Roberts, and A. Rzhetsky (Editors), American Mathematical Society, Providence, RI, 1997, pp. 183-208.
74. V. Makarenkov and B. Leclerc, An algorithm for the fitting of a tree metric according to a weighted least-squares criterion, J Classif 16 (1999), 3-26.
75. M.M. Mayamoto and W.M. Fitch, Testing species phylogenies and phylogenetic methods with congruence, Syst Biol 44 (1995), 64-76.
76. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience, New York, 1999.
77. R.D.M. Page and E.C. Holmes, Molecular evolution: A phylogenetic approach, Blackwell Science, Oxford, UK, 1998.
78. C. Papadimitriou and K. Steiglitz, Combinatorial optimization: Algorithms and complexity, Dover Publications, Mineola, NY, 1998.
79. Y. Pauplin, Direct calculation of a tree length using a distance matrix, J Mol Evol 51 (2000), 41-47.
80. W.R. Pearson, G. Robins, and T. Zhang, Generalized neighbor-joining: More reliable phylogenetic tree reconstruction, Mol Biol Evol 16 (1999), 806-816.
81. D. Penny, M.D. Hendy, and M.A. Steel, "Testing the theory of descendent," Phylogenetic analysis of DNA sequences, M.M. Mayamoto and J. Cracraft (Editors), Oxford University Press, New York, 1991, pp. 155-183.
82. S. Roch, A short proof that phylogenetic tree reconstruction by maximum likelihood is hard, IEEE-ACM T Comput Biol 3 (2006), 92-94.
83. F. Rodriguez, J.L. Oliver. A. Marin, and J.R. Medina, The general stochastic model of nucleotide substitution, J Theor Biol 142 (1990), 485-501.
84. A. Rzhetsky and M. Nei, Statistical properties of the ordinary least-squares generalized least-squares and minimum evolution methods of phylogenetic inference, J Mol Evol 35 (1992), 367-375.
85. A. Rzhetsky and M. Nei, Theoretical foundations of the minimum evolution method of phylogenetic inference, Mol Biol Evol 10 (1993), 1073-1095.
86. A. Rzhetsky and M. Nei, METREE: A program package for inferring and testing minimum evolution trees, Comput Appl Biosci 10 (1994), 409-412.
87. N. Saitou and M. Nei, The neighbor-joining method: A new method for reconstructing phylogenetic trees, Mol Biol Evol 4 (1987), 406-425.
88. S. Sattah and A. Tversky, Additive similarity trees, Psychometrika 42 (1977), 319-345.
89. C. Semple and M. Steel, Phylogenetics, Oxford University Press, New York, 2003.
90. C. Semple and M. Steel, Cyclic permutations and evolutionary trees, Adv Appl Math 32 (2004), 669-680.
91. P.H.A. Sneath and R.R. Sokal, Numerical taxonomy, W. K. Freeman and Company, San Francisco, CA, 1963.
92. J.A. Studier and K.J. Keppler, A note on the neighbor-joining algorithm of Saitou and Nei, Mol Biol Evol 5 (1988), 729-731.
93. D.L. Swofford, PAUP* version 4.0, Sinauer, Sunderland, MA, 1997.
94. D.L. Swofford, G.J. Olsen, P.J. Waddell, and D.M. Hillis, "Phylogenetic inference," Molecular systematics, D.M. Hillis, C. Moritz, and B.K. Mable (Editors), Sinauer & Associates, Sunderland, MA, 1996, pp. 407-514.
95. Y. Tateno, M. Nei, and F Tajima, Accuracy of estimated phylogenetic trees from molecular data, J Mol Evol 18 (1982), 387-404.
96. W. Vach, "Least-squares approximation of additive trees," Conceptual and numerical analysis of data, O. Opitz (Editor), Springer-Verlag, Berlin, 1989, pp. 230-238.
97. W. Vach and P.O. Degens, Least-squares approximation of additive trees to dissimilarities: Characterization and algorithms, Comput Stat Q 3 (1991), 203-218.
98. P.J. Waddell and M.A. Steel, General time-reversible distances with unequal rates across sites: Mixing gamma and inverse gaussian distributions with invariant sites, Mol Phylogenet Evol 8 (1997), 398-414.
99. M.S. Waterman, T.F. Smith, M. Singh, and W.A. Beyer, Additive evolutionary trees, J Theor Biol 64 (1977), 199-213.
100. S.J. Willson, Minimum evolution using ordinary least-squares is less robust than neighbor-joining, B Math Biol 67 (2005), 261-279.
101. B.Y Wu, K.M. Chao, and C.Y. Tang, Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices, J Comb Optim 3 (1999), 199-211.
102. K.M. Yu, J. Zhou, C.Y Lin, and C.Y. Tang, Parallel branch-and-bound algorithm for constructing evolutionary trees from distance matrix, Proc 8th Inter Conf High-Perform Comput Asia-Pacific Region, IEEE Computer Society, 2005, pp. 66-72.