Comparison of Different Sequence Alignment Methods- A Survey

Article Sidebar

PDF
Published: Jun 26, 2017
DOI: https://doi.org/10.26483/ijarcs.v8i5.3916
Keywords:
bioinformatics, sequence alignment, DNA, RNA, optimal alignment methods.

Main Article Content

Yadvir Kaur
Punjabi University, Patiala.
Neelofar Sohi
Punjabi University, Patiala.

Abstract

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.

Downloads

Download data is not yet available.

Article Details

Issue
Vol. 8 No. 5 (2017): May-June 2017
Section
Articles

COPYRIGHT

Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
  • The journal allows the author(s) to retain publishing rights without restrictions.
  • The journal allows the author(s) to hold the copyright without restrictions.
Author Biographies

Yadvir Kaur, Punjabi University, Patiala.

Student, Department of Computer Engineering,

Neelofar Sohi, Punjabi University, Patiala.

Assistant Professor, Department of Computer Engineering,

References

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.