Genetic algorithm for large-scale maximum parsimony phylogenetic analysis of proteins

Biochimica et Biophysica Acta - General Subjects

Volumn 1725, Issue 1, 2005, Pages 19-29

  Hill, Tobias ^a   Lundgren, Andor ^a   Fredriksson, Robert ^a   Schiöth, Helgi B ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Evolution; G protein coupled receptor; Genetic algorithm; Phylogeny

Indexed keywords

AMINO ACID; PROTEIN;

AMINO ACID SEQUENCE; ARTICLE; GENETIC ALGORITHM; PARSIMONY ANALYSIS; PHYLOGENY; PRIORITY JOURNAL; PROTEIN ANALYSIS; SCALE UP;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; HUMANS; LIKELIHOOD FUNCTIONS; PHYLOGENY; PROTEINS; SOFTWARE;

EID: 23844503582     PISSN: 03044165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.bbagen.2005.04.027     Document Type: Article

References (30)

1. D.M. Hillis Inferring complex phylogenies Nature (London) 383 1996 130 131
2. R. Fredriksson, M.C. Lagerstrom, L.G. Lundin, and H.B. Schioth The G-protein-coupled receptors in the human genome form five main families. Phylogenetic analysis, paralogon groups, and fingerprints Mol. Pharmacol. 63 6 2003 1256 1272
3. S. Cook Proceedings of the 3rd Annual Symposium on the Theory of Computing 1971 Association for Computing Machinery New York 151 158
4. W.H.E. Day Computational complexity of inferring phylogenies from dissimilarity matrices Bull. Math. Biol. 49 1987 461 467
5. A.H.F. Edwards, and L.L. Cavalli-Sforza Reconstruction of evolutionary trees V.H. Heywood J. McNeill Phenetic and Phylogenetic Classification 1964 Systematics Association London 67 76
6. J.H. Holland Adaptation in Natural and Artificial Systems 1975 MIT Press Cambridge
7. L. Davis Handbook of Genetic Algorithms 1991 Van Nostrand Reinhold New York
8. M. Mitchell An Introduction to Genetic Algorithms 1996 MIT Press London
9. E.K. Burke, and J.P. Newall A multistage evolutionary algorithm for the timetable problem IEEE Trans. Evol. Comput. 3 1 1999 63 74
10. M. Jensen Generating robust and flexible job shop schedules using genetic algorithms IEEE Trans. Evol. Comput. 7 3 2003 275 288
11. L. He, and N. Mort Hybrid genetic algorithms for telecommunications network back-up routing BT Technol. J. 18 4 2000 42 50
12. C.H. Ooi, and T. Patrick Genetic algorithms applied to multi-class prediction for the analysis of gene expression data Bioinformatics 19 2003 37 44
13. H. Matsuda Protein phylogenetic inference using maximum likelihood with a genetic algorithm L. Hunter T.E. Klein Pacific Symposium on Biocomputing ′96 1996 World Scientific London 512 523
14. P.O. Lewis A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data Mol. Biol. Evol. 15 1998 277 283
15. P.A. Goloboff Analyzing large data sets in reasonable times: solutions for composite optima Cladistics 15 1999 415 428
16. K.C. Nixon The Parsimony Ratchet, a new method for rapid parsimony analysis Cladistics 15 1999 407 414
17. K. Katoh, K. Kuma, and T. Miyata Genetic algorithm-based maximum-likelihood analysis for molecular phylogeny J. Mol. Evol. 53 2001 477 484
18. A.R. Lemmon, and M.C. Milinkovitch The metapopulation genetic algorithm: an efficient solution for the problem of large phylogeny estimation Proc. Natl. Acad. Sci. U. S. A. 1999 (Aug. 16) 10516 10521
19. J. Felsenstein PHYLIP (Phylogeny Inference Package). Version 3.57c. Distributed by the author 1995 Department of Genetics, University of Washington Seattle
20. R.V. Eck, and M.O. Dayhoff Atlas of Protein Sequence and Structure 1966 National Biomedical Research Foundation Silver Springs, MD
21. W.M. Fitch Toward defining the course of evolution: minimum change for a specific tree topology Syst. Zool. 20 1971 406 416
22. D. Sankoff Minimal mutation trees of sequences SIAM J. Appl. Math. 28 1975 35 42
23. M.O. Dayhoff, R. Schwartz, and B.C Orcutt M.O. Dayhoff Atlas of Protein Sequence and Structure vol. 5 1978 (Suppl. 3)
24. M.M. Meysenburg, and J.A. Foster The quality of pseudo-random number generators and simple genetic algorithm T. Back Proceedings of the Seventh International Conference on Genetic Algorithms 1997 Morgan Kaufmann San Francisco 276 282
25. J. Stoye, D. Evers, and F. Meyer Rose: generating sequence families Bioinformatics vol. 14 (2) 1998 OUP Press 157 163
26. N. Saitou, and M. Nei The neighbor-joining method: a new method for reconstructing phylogenetic trees Mol. Biol. Evol. 4 (4) 1987 406 425
27. Y. Zhong, C.A. Meacham, and S. Pramanik A general method for tree-comparison based on subtree similarity and its use in a taxonomic database Biosystems 42 1 1997 1 8
28. T. Säfström, A. Vernersson, Methods for objective comparison of phylogenetic trees. Msc thesis, Uppsala University, Uppsala, Sweden (2003).
29. J.D. Thompson, D.G. Higgins, and T.J. Gibson CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice Nucleic Acids Res. 22 22 1994 Nov. 11 4673 4680
30. 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. 19 17 2002 17 1726