A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 415-422

  Poladian, Leon ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Genetic algorithms; Genotype to phenotype mapping; Maximum likelihood; Neighbour joining; Phylogenetic inference

Indexed keywords

EVOLUTIONARY ALGORITHMS; MAXIMUM LIKELIHOOD ESTIMATION; STATISTICAL METHODS;

GENOTYPE TO PHENOTYPE MAPPING; NEIGHBOUR JOINING; PHYLOGENETIC INFERENCE;

GENETIC ENGINEERING;

EID: 32444450820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068076     Document Type: Conference Paper

References (34)

1. M. J. Brauer, M. T. Holder, L. A. Dries, D. J. Zwickl, P. O. Lewis, and D. M. Hillis. Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference. Mol. Biol. Evol., 20:1717-1726, 2002.
2. B. Chor, M. D. Hendy, B. R. Holland, and D. Penny. Multiple maxima of likelihood in phylogenetic trees: An analytic approach. Mol. Biol. Evol., 17:1529-1541, 2000.
3. C. B. Congdon. Gaphyl: A genetic algorithms approach to cladistics. In L. DeRaedt and A. Siebes, editors, Principles of Data Mining and Knowledge Discovery, pages 67-68. Lecture Notes in Computer Science, Vol 2168, Springer, Berlin, 2001.
4. C. B. Congdon. Gaphyl: an evolutionary algorithms approach for the study of natural evolution. In Genetic and Evolutionary Computation Conference, pages 1057-1064, San Francisco, California, 2002.
5. C. B. Congdon. Phylogenetic trees using evolutionary search: Initial progress in extending gaphyl to work with genetic data. In Congress on Evolutionary Computation, Canberra, Australia, 2003.
6. C. Cotta and P. Moscato. Inferring phylogenetic trees using evolutionary algorithms. Lecture Notes in Computer Science, 2439:720-729, 2002.
7. K. Deb and R. B. Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9:115-148, 1995.
8. A. W. F. Edwards. Estimation of the branch points of a branching diffusion processes. J. Royal Stat. Soc., 32:155-174, 1970.
9. L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval-schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms, volume 2, pages 187-202. Morgan-Kauffman Publishers, San Mateo, CA, November 1993.
10. J. Felsenstein. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol., 17:368-376, 1981.
11. J. Felsenstein. PHYLIP (Phytogeny Inference Package) Version 3.5c. Department of Genetics, University of Washington, Seattle, http://evolution.genetics.washington.edu/phylip.html, 1993.
12. J. Felsenstein. Inferring Phylogenies. Sinauer Associates, Inc, Sunderland, Mass., 2004.
13. W. M. Fitch. A non-sequential method for constructing trees and heirachical classifications. J. Mol. Evol., 18:30-37, 1981.
14. J. Gottlieb, B. A. Julstrom, G. R. Raidl, and F. Rothlauf, Prüfer numbers: A poor representation of spanning trees for evolutionary search. In L. Spector, E. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference 2001, pages 343-350, San Francisco, California, 2001.
15. S. Holmes. Statistics for phylogenetic trees. Theor. Pop. Biol., 63:17-32, 2003.
16. T. H. Jukes and C. R. Cantor. Evolution of protein molecules. In M. N. Munro, editor, Mammalian Protein Metabolism, Vol III, pages 21-132. Academic Press, New York, 1969.
17. K. Katoh, K. Kuma, and T. Miyata. Genetic algorithm-based maximum-likelihood analysis for molecular phylogeny. J. Mol. Evol., 53:477-484, 2001.
18. M. K. Kuhner and J. Felsenstein. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol., 11:459-468, 1994.
19. A. R. Lemmon and M. C. Milinkovich. The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation. PNAS, 99:10516-10521, 2002.
20. P. O. Lewis. A genetic algorithm for maximum likelihood phylogeny inference using nucletide sequence data. Mol. Biol. Evol., 15:277-283, 1998.
21. H. Matsuda. Protein phylogenetic inference using maximum likelihood with a genetic algorithm. In L. Hunter and T. Klein, editors, Pacific Symposium on Biocomputing '96, pages 512-523, London, 1996, World Scientific.
22. A. Moilanen. Searching for most parsimonious tree with simulated evolutionary optimisation. Clad., 15:39-50, 1999.
23. L. Poladian and L. S. Jermiin. Phylogenetic inference using evolutionary multi-objective optimisation. In Genetic and Evolutionary Computation Conference, Seattle, Washington, 2004.
24. L. Poladian and L. S. Jermiin. What might evolutionary algorithms (EA) and multi-objective optimisation (MOO) contribute to phylogenetics and the total evidence debate. In Genetic and Evolutionary Computation Conference, Seattle, Washington, 2004.
25. H. Prüfer. Neuer beweis eines satzes ueber permutationen. Archiv für Mathematik und Physik, 27:742744, 1918.
26. T. H. Reijmers, R. Wehrens, and L. M. C. Buydens. Quality criteria of genetic algorithms for construction of phylogenetic trees. J. Comp. Chem., 20:867-876, 1999.
27. D. F. Robinson and L. R. Foulds. Comparison of weighted labelled trees. In A. F. Horadam and W. D. Wallis, editors, Combinatorial Mathematics VI. Proceedings of the Sixth Australian Conference on Combinatorial Mathematics, volume 53, pages 119-126, Berlin, 1979. Springer-Verlag.
28. N. Saitou and M. Nei. The neighbour-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4:406-425, 1987.
29. M. Salemi and A.-M. VanDamme. Handbook of phylogenetic methods. Cambridge University Press, Cambridge, 2003.
30. S. Sattah and A. Tsversky. Additive similarity trees. Psychometrika, 42:319-345, 1977.
31. J. Shen and R. B. Heckendorn, Discrete branch length representations for genetic algorithms in phylogenetic search. Lecture Notes in Computer Science, 3005:94-103, 2004.
32. K. O. Stanley and R. Miikkulainen. A taxonomy for artificial embryogeny. Artificial Life, 9:93-130, 2003.
33. J. A. Studier and K. J. Keppler. A note on the neighbour-joining algorithm of saitou and nei. Mol. Biol. Evol., 5:729-731, 1988.
34. H. M. Voigt, H. Mühlenbein, and D. Cvetkovic. Fuzzy recombination for the breeder genetic algorithm. In L. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 104-111, San Mateo, CA, 1995. Morgan-Kauffman Publishers.