Multiple DNA sequence alignment based on genetic simulated annealing techniques

Multiple DNA sequence alignment is an important research topic of bioinformatics. In this paper, we present a new method for multiple DNA sequence alignment, based on genetic simulated annealing techniques, to choose the best cutting point set of the multiple DNA sequence set. The experimental results show that the proposed method gets higher scores and more match columns than the method presented in [3] for dealing with the multiple DNA sequence alignment problem.

[1]  I. O. Akinyemi,et al.  Aligning Multiple Sequences with Genetic Algorithm , 2009 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Andrew K. C. Wong,et al.  A genetic algorithm for multiple molecular sequence alignment , 1997, Comput. Appl. Biosci..

[4]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[5]  Cheng-Yan Kao,et al.  Using Genetic Algorithms to Solve Multiple Sequence Alignments , 2000, GECCO.

[6]  Andrew K. C. Wong,et al.  Toward efficient multiple molecular sequence alignment: a system of genetic algorithm and dynamic programming , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[7]  Prudence W. H. Wong,et al.  Efficient constrained multiple sequence alignment with performance guarantee , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[8]  J. Thompson,et al.  CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. , 1994, Nucleic acids research.

[9]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[10]  Toshio Shimizu,et al.  Multiple Sequence Alignment Using a Genetic Algorithm , 1996 .

[11]  Lin Feng,et al.  Parallel computation for multiple sequence alignments , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.

[12]  Robert C. Edgar.  MUSCLE: multiple sequence alignment with improved accuracy and speed , 2004, Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference, 2004. CSB 2004..

[13]  Yu Zhang,et al.  Eulerian path methods for multiple sequence alignment , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[14]  J. Stoye.  Multiple sequence alignment with the Divide-and-Conquer method. , 1998, Gene.

[15]  Shi-Jay Chen,et al.  Multiple DNA Sequence Alignment Based on Genetic Algorithms and Divide-and-Conquer Techniques , 2005 .

[16]  Christus,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .

[17]  Dennis Shasha,et al.  Anticlustal: multiple sequence alignment by antipole clustering and linear approximate 1-median computation , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[18]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[19]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[20]  Kumar Chellapilla,et al.  Multiple sequence alignment using evolutionary programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[21]  Michael S. Waterman,et al.  General methods of sequence comparison , 1984 .

[22]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[23]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[24]  Seiichi Koakutsu,et al.  GENETIC SIMULATED ANNEALING AND APPLICATION TO NON-SLICING FLOORPLAN DESIGN , 1995 .

[25]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[26]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[27]  Raymond A. Paul,et al.  Parallel multiple sequence alignment with dynamic scheduling , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[28]  Fern Y. Hunt,et al.  A linear programming based algorithm for multiple sequence alignments , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[29]  D. Higgins,et al.  SAGA: sequence alignment by genetic algorithm. , 1996, Nucleic acids research.