CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

A Noble Approach on Bioinformatics: Smart Sequence Alignment Algorithm applying DNA Replication (SSAADR)

by Paramita Basak Upama, Jarin Tasnim Khan, Zeba Yasmin, Farah Zemim, Nazmus Sakib
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 8 - Number 1
Year of Publication: 2014
Authors: Paramita Basak Upama, Jarin Tasnim Khan, Zeba Yasmin, Farah Zemim, Nazmus Sakib
10.5120/ijais14-451279

Paramita Basak Upama, Jarin Tasnim Khan, Zeba Yasmin, Farah Zemim, Nazmus Sakib . A Noble Approach on Bioinformatics: Smart Sequence Alignment Algorithm applying DNA Replication (SSAADR). International Journal of Applied Information Systems. 8, 1 ( December 2014), 23-28. DOI=10.5120/ijais14-451279

@article{ 10.5120/ijais14-451279,
author = { Paramita Basak Upama, Jarin Tasnim Khan, Zeba Yasmin, Farah Zemim, Nazmus Sakib },
title = { A Noble Approach on Bioinformatics: Smart Sequence Alignment Algorithm applying DNA Replication (SSAADR) },
journal = { International Journal of Applied Information Systems },
issue_date = { December 2014 },
volume = { 8 },
number = { 1 },
month = { December },
year = { 2014 },
issn = { 2249-0868 },
pages = { 23-28 },
numpages = {9},
url = { https://www.ijais.org/archives/volume8/number1/705-1279/ },
doi = { 10.5120/ijais14-451279 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T18:58:38.716093+05:30
%A Paramita Basak Upama
%A Jarin Tasnim Khan
%A Zeba Yasmin
%A Farah Zemim
%A Nazmus Sakib
%T A Noble Approach on Bioinformatics: Smart Sequence Alignment Algorithm applying DNA Replication (SSAADR)
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 8
%N 1
%P 23-28
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Alignment generally means lining up characters of strings, allowing matches and mismatches and also the characters of one string to be placed opposite spaces made in opposing strings. Sequence alignment arises in many fields, such as: molecular biology, inexact text matching (e. g. spell checkers; web page search), speech recognition and many more. This Paper presents a new implemented algorithm for sequence alignment based on the concepts of some already established algorithms of Bioinformatics which is named as "Smart Sequence Alignment Algorithm applying DNA Replication", in short "SSAADR". It aligns two sequences of any length, based on filling up a matrix of size m X n where m is the length of the first sequence and n is the length of the second sequence, and using the techniques of both global and local alignment. To make the proposed algorithm faster, the theory of DNA replication has also been introduced here, according to which, while using the alternative sequences of both DNA sequences instead of the original ones, the execution time of the proposed algorithm SSAADR decreases immensely.

References
  1. N. Islam, Faster and efficient algorithm for sequence alignment, 2012.
  2. M. S. I. Mahmud, M. A. Hosen, Saroer-E-Azam, M. M. Hawlader and Abdullah Al-Mamun, "A Novel Two-Tier Multiple Sequence Alignment Algorithm," in 13th International Conference on Computer and Information Technology (ICCIT 2010), 2010.
  3. E. S. Lander, L. M. Linton, B. Birren, C. Nusbaum, M. C. Zody and J. Baldwin, "Initial sequencing and analysis of the human genome," Nature, pp. 860-921, 2001.
  4. B. Erickson and P. Sellers, "Recognition of patterns in genetic sequences," pp. 55-91, 1983.
  5. "Exploring Life's Origins: What is RNA?," [Online]. Available: http://exploringorigins. org/rna. html .
  6. V. S. Krishna, P. A. Rasool and D. N. Khare, "String Matching and its Applications in Diversified Fields," IJCSI International Journal of Computer Science Issues, vol. 9, no. 1, pp. 219-224, 2012.
  7. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski and W. Rytter, "Speeding Up Two String-Matching Algorithms," Algorithmica, vol. 12, no. 4-5, pp. 247-267, 1994.
  8. D. Papamichail and G. Papamichail, "Improved algorithms for approximate string matching," BMC Bioinformatics, pp. 1-18, 2009.
  9. S. A. de Carvalho Junior, "Sequence Alignment Algorithms," pp. 4-12, 2003.
  10. D. Knuth, V. Pratt and J. . H. Morris, "Fast pattern matching in strings," SIAM Journal on Computing, vol. 6, no. 2, pp. 323-350, 1977.
  11. A. Hume and D. M. Sunday, "Fast string searching," Software—Practice & Experience, vol. 21, no. 11, pp. 1221-1248, 1991.
  12. N. Kommajosyula, "Regulation of DNA Replication Origins in Fission Yeast: A Dissertation," GSBS Dissertations and Theses, pp. 1-12, 2009.
  13. Watson, J. D. & Crick and F. H. C. , "Molecular structure of nucleic acids - A structure for deoxyribose nucleic acid," Nature, vol. 171, pp. 737-738, 1953.
  14. S. Needleman and C. 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.
  15. S. F. Altschul, "Global and Local Sequence Alignment," pp. 2-34.
  16. T. Smith and M. Waterman, "Identification of common molecular subsequences," Journal of Molecular Biology, vol. 147, pp. 195-197, 1981.
  17. 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.
  18. I. Yurchenko, "Z algorithm | Ivan Yurchenko," [Online]. Available: http://ivanyu. me/blog/2013/10/15/z-algorithm/.
  19. Codeforces, "Z Algorithm-Codeforces," [Online]. Available: http://codeforces. com/blog/entry/3107.
  20. R. S. Boyer and J. S. Moore, "A Fast String Searching Algorithm," Communications of the ACM (New York, NY, USA: Association for Computing Machinery), vol. 20, no. 0, pp. 762-772, 1977.
  21. Amrita. vlab. co. in, "Global alignment of two sequences - Needleman-Wunsch Algorithm (Theory) : Bioinformatics Virtual Lab II : Biotechnology and Biomedical Engineering : Amrita VishwaVidyapeetham Virtual Lab," [Online]. Available: http://amrita. vlab. co. in/?sub=3&brch=274∼=1431&cnt=1. .
  22. N. F. A. Saliman, N. D. A. Sabri, S. A. M. A. Junid, N. . M. Tahir and Z. A. Majid, "Smith-Waterman Algorithm Traceback Optimization using Structural Modelling Technique," International Journal of Simulation,Systems,Science & Technology, pp. 64-65, 2008.
  23. S. A. Shehab, A. Keshk and H. Mahgoub, "Fast Dynamic Algorithm for Sequence Alignment based on Bioinformatics," International Journal of Computer Applications (0975 – 8887), vol. 37, no. 7, pp. 54-60, 2012.
  24. B. Strengholt and M. Brobbel, "Acceleration of the Smith-Waterman algorithm for DNA sequence alignment using an FPGA," pp. 11-19, 2013.
  25. A. Wozniak, "Using video-oriented instructions to speed up sequence comparison," Computer applications in the biosciences: CABIOS, vol. 13, no. 2, pp. 145-150, 1997.
Index Terms

Computer Science
Information Sciences

Keywords

Sequence alignment DNA RNA Dynamic Algorithms Z Algorithm Boyer-Moore Algorithm Needleman-Wunsch (NW) Algorithm and Smith-Waterman (SW) Algorithm.

Powered by PhDFocusTM