Comparison of Different Sequence Alignment Methods- A Survey

Yadvir Kaur, Neelofar Sohi


Bioinformatics is a promising and inventive research field. Biological Sequence alignment is the inborn part of bioinformatics, which helps to find similarity between biological sequences i.e. DNA and protein. Alignment of biological sequences helps to discover functional and structural similarity of sequences. The biological sequence database has been expanding rapidly due to new sequences being found, which has raised the demand to employ more efficient and fast algorithm. There has been an eruption algorithm in the past few decades to find optimal or nearly-optimal alignments. This paper is focused on the popular sequence alignment algorithms. Different types of alignment method have been discussed on the basis of their optimality and approximate solutions. It has been studied that optimal algorithms, which are based on dynamic programming are giving exact solutions. But these are highly computationally complexed. The stochastic optimization methods has been chosen from literature as the potential candidates for the solution of complex multiple sequence alignments with better speed and care.


bioinformatics; sequence alignment; DNA; RNA; optimal alignment methods.

Full Text:



W. Haque, A. Aravind, and B. Reddy, “Pairwise sequence alignment algorithms: a survey”, In Proceedings of the conference on Information Science, Technology and Applications, pp. 96-103, March 2009.

M.O. Dayhoff, “Survey of new data and computer methods of analysis” Atlas of protein sequence and

structure, 1976.

S. Henikoff, and J. G. Henikoff, “Amino acid substitution matrices from protein blocks” Proceedings of the National Academy of Sciences, vol. 89, no.22, pp. 10915-10919, 1992.

J. Cohen, “Bioinformatics—an introduction for computer scientists” ACM Computing Surveys (CSUR), vol. 36, no. 2, pp. 122-158, 2004.

C. Gondro, and B. P. Kinghorn, “A simple genetic algorithm for multiple sequence alignment”, Genetics and Molecular Research, vol. 6, no. 4, pp. 964-982, 2007.

J. Xiong, “Essential bioinformatics” Cambridge University Press, 2006.

L. Hasan, and Z. Al-Ars, “An overview of hardware-based acceleration of biological sequence alignment”, INTECH Open Access Publisher, 2011.

S. B. Needleman, and C. D. Wunsch, “A general method applicable to the search for similarities in the amino acid sequence of two proteins”, Journal of molecular biology, vol. 48, no. 3, pp. 443-453, 1970.

E. S. Orabi, M. A. Assal, M. A. Azim, and Y. Kamal, “DNA fingerprint using smith waterman algorithm by grid computing”, 2014 9th IEEE International Conference on In Informatics and Systems (INFOS), December 2014.

S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, “Basic local alignment search tool”, Journal of molecular biology, vol. 215, no. 3, pp. 403-410, 1990.

W. R. Pearson, “Rapid and sensitive sequence comparison with FASTP and FASTA”, Methods in enzymology, vol. 183, pp. 63-98, 1990.

R. K. Jena, M. M. Aqel, P. Srivastava, and P.K. Mahanti, “Soft computing methodologies in bioinformatics”, European Journal of Scientific Research, vol. 26, no.2, pp. 189-203, 2009.

I. O. Bucak, and V. Uslan, “Sequence alignment from the perspective of stochastic optimization: a survey”, Turkish Journal of Electrical Engineering & Computer Sciences, vol. 19, no.1, pp. 157-173, 2011.



  • There are currently no refbacks.

Copyright (c) 2017 International Journal of Advanced Research in Computer Science