A simple genetic algorithm for multiple sequence alignment

Genetics and Molecular Research

Volumn 6, Issue 4, 2007, Pages 964-982

  Gondro, C ^a   Kinghorn, B P ^a  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

Author keywords

Evolutionary computation; Genetic algorithms; Multiple sequence alignment; Optimization

Indexed keywords

AMINO ACID; NUCLEOTIDE;

COMPUTER PROGRAM; CONFERENCE PAPER; EVOLUTIONARY ALGORITHM; GENETIC ALGORITHM; MEASUREMENT; MEDICAL RESEARCH; OPEN FIELD TEST; OUTCOME ASSESSMENT; POPULATION; SCORING SYSTEM; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; VELOCITY;

ALGORITHMS; AMINO ACID SEQUENCE; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; MOLECULAR SEQUENCE DATA; PROTEINS; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 37349000985     PISSN: None     EISSN: 16765680     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (49)

1. Altschul SF (1989). Gap costs for multiple sequence alignment. J. Theor. Biol. 138: 297-309.
2. Anbarasu LA, Narayanasamy P and Sundararajan V (2000). Multiple molecular sequence alignment by island parallel genetic algorithm. Curr. Sci. 78: 858-863.
3. Atmar W (1994). Notes on the simulation of evolution. IEEE Trans. Neural Networks 5: 130-147.
4. Bäck T, Fogel DB and Michalewicz T (2000). Evolutionary computation 1: basic algorithms and operators. Institute of Physics Publishing, Bristol.
5. Bahr A, Thompson JD, Thierry JC and Poch O (2001). BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations. Nucleic Acids Res. 29: 323-326.
6. Bellman RE (2003). Dynamic programming. Dover Publications, Dover.
7. Bonizzoni P and Della Vedova G (2001). The complexity of multiple sequence alignment with SP-score that is a metric. Theor. Comp. Sci. 259: 63-79.
8. Chellapilla K and Fogel GB (1999). Multiple sequence alignment using evolutionary programming. Congress on Evolutionary Computation (CEC99), Washington DC.
9. Chenna R, Sugawara H, Koike T, Lopez R, et al. (2003). Multiple sequence alignment with the Clustal series of programs. Nucleic Acids Res. 31: 3497-3500.
10. Dayhoff MO (1978). Survey of new data and computer methods of analysis. In: Atlas of protein sequence and structure 5, Suppl 3 (Dayhoff MO, ed.). National Biomedical Research Foundation, Silver Springs, 2-8.
11. Durbin R, Eddy S, Krogh A and Mitchison G (1998). Biological sequence analysis: probabalistic models of proteins and nucleic acids. Cambridge University Press, Cambridge.
12. Ebedes J and Datta A (2004). Multiple sequence alignment in parallel on a workstation cluster. Bioinformatics 20: 1193-1195.
13. Eddy SR (1998). Profile hidden Markov models. Bioinformatics 14: 755-763.
14. Edgar RC (2004). MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics 5: 113.
15. Eshelman LJ (2000). Genetic algorithms. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol.
16. Feng DF and Doolittle RF (1987). Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol. 25: 351-360.
17. George DG, Barker WC and Hunt LT (1990). Mutation data matrix and its uses. Methods Enzymol. 183: 333-351.
18. Goldberg DE (1987). Simple genetic algorithms and the minimal, deceptive problem. In: Genetic algorithms and simulated annealing (Davis L, ed.). Morgan Kaufmann, San Mateo, 74-88.
19. Gonnet GH, Cohen MA and Benner SA (1992). Exhaustive matching of the entire protein sequence database. Science 256: 1443-1445.
20. Henikoff S and Henikoff JG (1992). Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA 89: 10915-10919.
21. Hirosawa M, Totoki Y, Hoshida M and Ishikawa M (1995). Comprehensive study on iterative algorithms of multiple sequence alignment. Comput. Appl. Biosci. 11: 13-18.
22. Jones DT, Taylor WR and Thornton JM (1992). The rapid generation of mutation data matrices from protein sequences. Comput. Appl. Biosci. 8: 275-282.
23. Just W (2001). Computational complexity of multiple sequence alignment with SP-score. J. Comput. Biol. 8: 615-623.
24. Karplus K and Hu B (2001). Evaluation of protein multiple alignments by SAM-T99 using the BAliBASE multiple alignment test set. Bioinformatics 17: 713-720.
25. Kim J, Pramanik S and Chung MJ (1994). Multiple sequence alignment using simulated annealing. Comput. Appl. Biosci. 10: 419-426.
26. Lipman DJ, Altschul SF and Kececioglu JD (1989). A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. USA 86: 4412-4415.
27. McClure MA, Vasi TK and Fitch WM (1994). Comparative analysis of multiple protein-sequence alignment methods. Mol. Biol. Evol. 11: 571-592.
28. Michalewicz T and Fogel DB (2000). How to solve it: modern heuristics. Springer-Verlag, Heidelberg.
29. Mount WD (2004). Bioinformatics: sequence and genome analysis. Cold Spring Harbor Laboratory Press, New York.
30. Needleman SB and Wunsch CD (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48: 443-453.
31. Nguyen HD, Yoshihara I, Yamamori K and Yasunaga M (2002). Aligning multiple protein sequences by parallel hybrid genetic algorithm. Genome Inform. 13: 123-132.
32. Notredame C (2002). Recent progress in multiple sequence alignment: a survey. Pharmacogenomics 3: 131-144.
33. Notredame C and Higgins DG (1996). SAGA: sequence alignment by genetic algorithm. Nucleic Acids Res. 24: 1515-1524.
34. Notredame C, Holm L and Higgins DG (1998). COFFEE: an objective function for multiple sequence alignments. Bioinformatics 14: 407-422.
35. Notredame C, Higgins DG and Heringa J (2000). T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 302: 205-217.
36. Riaz T, Wang Y and Li KB (2004). Multiple sequence alignment using tabu search. Procceedings of the 2nd Conference on Asia-Pacific Bioinformatics. Australian Computer Society, New Zealand, 223-232.
37. Saitou N and Nei M (1987). The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4: 406-425.
38. Sander C and Schneider R (1991). Database of homology-derived protein structures and the structural meaning of sequence alignment. Proteins 9: 56-68.
39. Shyu C, Sheneman L and Foster JA (2004). Multiple sequence alignment with evolutionary computation. Genet. Prog. Evol. Mach. 5: 121-144.
40. Smith TF and Waterman MS (1981). Identification of common molecular subsequences. J. Mol. Biol. 147: 195-197.
41. Stoye J, Perrey SW and Dress AWM (1997). Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment. App. Maths. Letters 10: 67-73.
42. Taylor WR (1987). Multiple sequence alignment by a pairwise algorithm. Comput. Appl. Biosci. 3: 81-87.
43. Thompson JD, Higgins DG and Gibson TJ (1994). 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: 4673-4680.
44. Thompson JD, Plewniak F and Poch O (1999a). A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res. 27: 2682-2690.
45. Thompson JD, Plewniak F and Poch O (1999b). BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15: 87-88.
46. Thomsen R and Boomsma W (2004). Multiple sequence alignment using SAGA: investigating the effects of operator scheduling, population seeding, and crossover operators. Appl. Evol. Comput. 3005: 113-122.
47. Thomsen R, Fogel GB and Krink T (2002). A Clustal alignment improver using evolutionary algorithms. Proceedings of the 4th Congress on Evolutionary Computation (CEC2002), Honolulu, 121-126.
48. Wallace IM, O'Sullivan O and Higgins DG (2005). Evaluation of iterative alignment algorithms for multiple alignment. Bioinformatics 21: 1408-1414.
49. Zhang C and Wong AK (1997). A genetic algorithm for multiple molecular sequence alignment. Comput. Appl. Biosci. 13: 565-581.