Abstract
Given a set of N (N>2) sequences, the Multiple Sequence Alignment (MSA) problem is to align these N sequences, possibly with gaps, that bring out the best score due to a given scoring criterion between characters. Multiple sequence alignment is one of the basic tools for interpreting the information obtained from bioinformatics studies. Dynamic Programming (DP) gives the optimal alignment of the two sequences for the given scoring scheme. But, in the case of multiple sequence alignment it requires enormous time and space to obtain the optimal alignment. The time and space requirement increases exponentially with the number of sequences. There are two basic classes of solutions except the DP method: progressive methods and iterative methods. In this study, we try to refine the alignment score obtained by using the progressive method due to given scoring criterion by using an iterative method. As an iterative method genetic algorithm (GA) has been used. The sum-of-pairs (SP) scoring system is used as our target of optimization. There are fifteen operators defined to refine the alignment quality by combining and mutating the alignments in the alignment population. The results show that the novel operators, sliding-window, local-alignment, which have not been used up to now, increase the score of the progressive alignment by amount of % 2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Morgenstern, B., Dress, A.W.M., Werner, T.: Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. N&l, Acad. Sci. USA 93, 12098–12103 (1996)
Gusfield, D.: Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology 55, 141–154 (1993)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences, Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Wang, L., Jiang, T.: On the complexity of multiple sequence alignment. Journal of Computational Biology 1, 337–348 (1994)
Waterman, M.S.: Introduction to Computational Biology: Maps, Sequences, and Genomes. Chapman & Hall, London (1995)
Altschul, S., Lipman, D.: Trees, stars, and multiple sequence alignment. SIAM J. Appl. Math. 49, 197–209 (1989)
Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443–453 (1970)
Notredame, C., Higgins, D.G.: SAGA: Sequence Alignment by Genetic Algorithm. Nucleic Acids Res. 24, 1515–1524 (1996)
Notredame, C., O’Brien, E.A., Higgins, D.G.: RAGA: RNA sequence alignment by genetic algorithm. Nucleic Acids Res. 25, 4570–4580 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ergezer, H., Leblebicioğlu, K. (2006). Refining the Progressive Multiple Sequence Alignment Score Using Genetic Algorithms. In: Savacı, F.A. (eds) Artificial Intelligence and Neural Networks. TAINN 2005. Lecture Notes in Computer Science(), vol 3949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11803089_21
Download citation
DOI: https://doi.org/10.1007/11803089_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36713-0
Online ISBN: 978-3-540-36861-8
eBook Packages: Computer ScienceComputer Science (R0)