An algorithm for the maximum likelihood problem on evolutionary trees

Journal of Combinatorial Optimization

Volumn 10, Issue 1, 2005, Pages 61-75

  Oliveira, Carlos A S ^a  

^a Oklahoma State University   (United States)

Author keywords

Combinatorial optimization; Genetic algorithm; Genetic sequences; Phylogenetic analysis

Indexed keywords

ANCESTRAL MAXIMUM LIKELIHOOD (AML); COMBINATORIAL OPTIMIZATION; GENETIC SEQUENCES; MAXIMUM LIKELIHOOD (MLET); MAXIMUM PARSIMONY (MP); PHYLOGENETIC ANALYSIS;

COMPUTATION THEORY; ENTROPY; FUNCTION EVALUATION; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING; TREES (MATHEMATICS);

GENETIC ALGORITHMS;

EID: 23944457686     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-005-1860-2     Document Type: Conference Paper

References (25)

1. L. Addario-Berry, B. Chor, M.T. Hallett, J. Lagergren, A. Panconesi, and T. Wareham, "Ancestral maximum likelihood of evolutionary trees is hard," in WABI, 2003, pp. 202-215.
2. D. Barker, "LVB: Parsimony and simulated annealing in the search for phylogenetic trees," Bioinformatics, vol. 20, pp. 274-275, 2004.
3. P. Bevington, Data Reduction and Error Analysis for the Physical Sciences, McGraw-Hill, New York, 1969, Chapters 1-4.
4. M. Brauer, M. Holder, L. Dries, D. Zwickle, P. Lewis, and D. Hillis, "Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference," Mol. Biol. Evol., vol. 19, no. 10, pp. 1717-1726, 2002.
5. B. Chor, M. Hendy, B. Holland, and D. Penny, "Multiple maxima of likelihood in phylogenetic trees: An analytic approach," Mol. Biol. Evol., vol. 17, no. 10, pp. 1529-1541, 2000.
6. W. Day, D. S. Johnson, and D. Sankoff, "The computational complexity of inferring rooted phylogenies," Math. Biosci., vol. 81, pp. 33-42, 1986.
7. M. Ericsson, M. Resende, and P. Pardalos, "A genetic algorithm for the weight setting problem in OSPF routing," J. of Combinatorial Optimization, vol. 6, pp. 299-333, 2002.
8. L. Foulds and R. Graham, "The Steiner problem in phylogeny is NP-complete," Adv. Appl. Math., vol. 3, pp. 43-49, 1982.
9. L. Gasieniec, J. Jansson, and A. Lingas, "Efficient approximation algorithms for the hamming center problem," In Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. S905-S906, 1999.
10. F. Glover, "A template for scatter search and path relinking," in J. Hao, E. Lutton, E. Ronald, M. Shoenau, and D. Snyers, (eds.) Artificial Evolution: Third European Conference, number 1363 in Lecture Notes in Computer Science. Springer Verlag, 1998, pp. 13-54.
11. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Kluwer Academic Publishers, Boston, MA, 1989.
12. J. Gonçalves, J. Mendes, and M. Resende, "A hybrid genetic algorithm for the job shop scheduling problem," European J. of Operational Research, 2004, to appear.
13. J. Gonçalves and M. Resende, "A hybrid genetic algorithm for manufacturing cell formation," Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2002.
14. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
15. K. Katoh, K.-I. Kuma, and T. Miyata, "Genetic algorithm-based maximum-likelihood analysis for molecular phylogeny," J. Mol. Evol., vol. 53, pp. 477-484, 2001.
16. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, "Distinguishing string selection problems," Information and Computation, vol. 185, no. 1, pp. 41-55, 2003.
17. P. Lewis, "A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data," Mol Biol Evol, vol. 15, no. 3, pp. 277-283, 1998.
18. C.N. Meneses, Z. Lu, C.A. Oliveira, and P.M. Pardalos, "Optimal solutions for the closest string problem via integer programming," INFORMS Journal on Computing, vol. 16, no. 4, pp. 419-429, 2004.
19. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts," Technical report, California Institute of Technology, 1989.
20. T. Pupko, D. Huchon, Y. Cao, N. Okada, and M. Hasegawa, "Combining multiple data sets in a likelihood analysis: which models are the best?" Mol Biol Evol, vol. 19, no. 12, pp. 2294-2307, 2002.
21. I. Rechenberg, Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog Verlag, Stuttgart, 1973.
22. H. P. Schwefel. Numerical Optimization of Computer Models, Wiley, Chichester, 1981.
23. M. Steel and D. Penny, "Parsimony, likelihood and the role of models in molecular phylogenetics," Mol Biol Evol, vol. 17, no. 6, pp. 839-850, 2000.
24. D.L. Swofford, G.J. Olsen, P.J. Waddell, and D.M. Hillis, "Phylogenetic inference," in D.M. Hillis, C. Moritz, and B. Mable, (eds.), Molecular Systematics. Sinauer Associates, Sunderland, MA, 2nd edition, 1996, pp. 407-514.
25. Z. Yang, "Maximum likelihood phylogenetic estimation from dna sequences with variable rates over sites: approximate methods," J Mol Evol., vol. 39, no. 3, pp. 306-314, 1994.