Abstract
Sequence Alignment is a basic information disposal method in Bioinformatics. However, it is difficult to deal with multiple sequence alignment problem(MSA). In this paper, an improved particle swarm optimization is designed to solve MSA. In the algorithm, each particle represents an alignment and flies to the particle which has the best solution by some rules. Moreover, in order to expand the diversity of the algorithm and enhance the possibility of finding the optimal solution, three operators are designed, that is, gaps deletion, gaps insertion, and local search operator. Simulation results show that for MSA proposed algorithm is superior to Clustal X.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Wang, L., Jiang, T.: On the Complexity of Multiple Sequence Alignment. J. Comput. Biol. 1(4), 337–348 (1994)
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)
Lawrence, C.E., Altschul, S., Boguski, M., Liu, J., Neuwald, A., Wootton, J.: Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment. Science 262, 208–214 (1993)
Hogeweg, P., Hesper, B.: The Alignment of Sets of Sequences and the Construction of Phyletic Trees: an Integrated Method. J. Mol. E 20, 175–186 (1984)
Feng, D.F., Doolittle, R.F.: Progressive Sequence Alignment as a Prerequisite to Correct Phylogenetic Trees. J. Mol. E 25(4), 351–360 (1987)
Thompson, J.D., Higgins, D.G., Gibson, T.J.: 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), 4673–4680 (1994)
Notredame, C., Higgins, D.G., Heringa, J.: T-Coffee: A Novel Method for Fast and Accurate Multiple Sequence Alignment. J. Mol. Biol. 302(1), 205–217 (2000)
Bahr, A., Thompson, J.D., Thierry, J.C., Poch, O.: Balibase (Benchmark Alignment Database): Enhancements for Repeats, Transmembrane Sequences and Circular Permutations. Nucl. Acids Res. 29(1), 323–326 (2001)
Thompson, J.D., Plewniak, F., Poch, O.: Balibase: A Benchmark Alignment Database for the Evaluation of Multiple Alignment Programs. Bioinformatics 15(1), 87–88 (1999)
Notredame, C., Higgins, D.G.: Saga: Sequence Alignment by Genetic Algorithm. Nucleic Acids Res. 24(8), 1515–1524 (1996)
Hirosawa, M., Totoki, Y., Hoshida, M., Ishikawa, M.: Comprehensive Study on Iterative Algorithms of Multiple Sequence Alignment. Comput. Appl. Biosci. 11(1), 13–18 (1995)
Henikoff, S., Henikoff, J.G.: Amino Acid Substitution Matrices from Protein Blocks. Proc. Natl. Acad. Sci. USA 89(22), 10915–10919 (1992)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Piscataway (1995)
Eberhart, R., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proc. 6th Int Sympossum on Micro Machine and Human Science, pp. 39–43. IEEE Press, Piscataway (1995)
Rodriguez, P.F., Nino, L.F., Alonso, O.M.: Multiple Sequence Alignment using Swarm Intelligence. International Journal of Computational Intelligence Research 3(2), 123–130 (2007)
National Center for Biotechnology Information, http://www.ncbi.nlm.nih.gov
Clustal W Download Page, http://www.clustal.org/download/current/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, F., Chen, Y. (2009). A Method for Multiple Sequence Alignment Based on Particle Swarm Optimization. In: Huang, DS., Jo, KH., Lee, HH., Kang, HJ., Bevilacqua, V. (eds) Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence. ICIC 2009. Lecture Notes in Computer Science(), vol 5755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04020-7_104
Download citation
DOI: https://doi.org/10.1007/978-3-642-04020-7_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04019-1
Online ISBN: 978-3-642-04020-7
eBook Packages: Computer ScienceComputer Science (R0)