Abstract
The problem of pairwise sequence alignment is the fundamental and important problem in computational biology. The success of pairwise sequence alignment algorithm lies in its accuracy of the sequences being aligned in bioinformatics. For getting higher accuracy in an ideal period of time, we proposed a new method based on Chemical reaction optimization. Chemical reaction optimization (CRO) is a new metaheuristic algorithm, which inspired by the nature of chemical reactions. Be similar to genetic algorithm, CRO is a design framework and has gained excellent performance in solving many problems, for example, grid scheduling problem, quadratic assignment etc. In this paper, we firstly apply CRO to solve pairwise sequence alignment, modify the four operators to satisfy the requirement of sequence alignment. From the simulation results, the performance of proposed algorithm is better or equivalent but never worse than GA and ACO.
This is a preview of subscription content, log in via an institution to check access.
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
Krane, D.E., Raymer, M.L.: Introduction to bioinformatics. Tsinghua University Press, Beijing (2004)
Needleman, S.B., Wunson, 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)
Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. J. Mol. Biol. 147, 195–197 (1981)
Ljpman, D.J., Pearson, W.R.: Rapid and sensitive protein similarity searches. Science 227, 1435–1441 (1981)
Altschul, S.F., Gish, W., Miller, W., Myer, E.W., et al.: Basic local alignment search tool. Journal of Molecular Biology 215, 403–410 (1990)
Gondro, C., Kinghorn, B.P.: A simple genetic algorithm for multiple sequence alignment. Genetic and Molecular Research 6, 964–982 (2007)
Jangam, S.R., Chakraborti, N.: A novel method for alignment of two nucleic acid sequences using ant colony optimization and genetic algorithms. Applied Soft Computing 7, 1121–1130 (2007)
Notredame, C., Higgins, G.D.: SAGA: sequence alignment by genetic algorithm. Nucleic Acids Res. 8, 1515–1524 (1996)
Notredame, C., O’Brien, E.A., Higgins, D.G.: Raga: RNA sequence alignment by genetic algorithm. Nucl. Acids Res. 22, 4570–4580 (1997)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Systems Man Cybern., Part B 1, 29–41 (1996)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 3, 67 (1997)
Lam, A.Y.S., Li, V.O.K.: Chemical-Reaction-Inspired Metaheuristic for Optimization. IEEE Transactions on Evolutionary Computation 7, 381–399 (2010)
Lam, A.Y.S., Li, V.O.K.: Chemical Reaction Optimization: a tutorial. Memetic Computing 4, 3–17 (2012)
National Center for Biotechnology Information, http://www.ncbi.nlm.nih.gov
Bioinformatics tools for pairwise sequence alignment, http://www.ebi.ac.uk/Tools/psa/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, D., Zhu, X. (2014). A Novel Method Based on Chemical Reaction Optimization for Pairwise Sequence Alignment . In: Li, K., Xiao, Z., Wang, Y., Du, J., Li, K. (eds) Parallel Computational Fluid Dynamics. ParCFD 2013. Communications in Computer and Information Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53962-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-53962-6_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53961-9
Online ISBN: 978-3-642-53962-6
eBook Packages: Computer ScienceComputer Science (R0)