CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences

by S. Nirmala Devi, S. P. Rajagopalan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 60 - Number 18
Year of Publication: 2012
Authors: S. Nirmala Devi, S. P. Rajagopalan
10.5120/9790-4347

S. Nirmala Devi, S. P. Rajagopalan . A Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences. International Journal of Computer Applications. 60, 18 ( December 2012), 5-9. DOI=10.5120/9790-4347

@article{ 10.5120/9790-4347,
author = { S. Nirmala Devi, S. P. Rajagopalan },
title = { A Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences },
journal = { International Journal of Computer Applications },
issue_date = { December 2012 },
volume = { 60 },
number = { 18 },
month = { December },
year = { 2012 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume60/number18/9790-4347/ },
doi = { 10.5120/9790-4347 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:07:18.882519+05:30
%A S. Nirmala Devi
%A S. P. Rajagopalan
%T A Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences
%J International Journal of Computer Applications
%@ 0975-8887
%V 60
%N 18
%P 5-9
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a Modified Dynamic Parallel Algorithm for Sequence Alignment in BioSequences. DNA sequence alignment between two or more bio sequences using algorithms is a complex problem due to its applicability in the field of biology. This algorithm achieves its efficiency in using computational resources by making a M X N matrix , M represents the length of first sequence and N represents the length of the second sequence . This modified Dynamic algorithm performs calculation to fill the three main diagonal cells without evaluating other cells in the matrix. The proposed model is based on Index Based Pattern Matching using Multithreading [13] to obtain the optimal alignment using Multithreading. The executed results indicate that with the proposed algorithm Memory Efficiency and Fast Execution are achieved over the well-known dynamic programming approach Needleman-Wunsch and Hirschberg approach.

References
  1. Amine Dhraief, Parallel Computing the Longest Common Subsequences (LCS) on GPUs: Efficiency and Language Suitability, INFOCOMP 2011 : The first International Conference on Advanced Communications and Computation.
  2. Hirschberg, D. S 1977. Algorithms for the longest common subsequence problem. Journal of ACM ,24:664-675.
  3. A. Aho, D. Hirschberg and B. Jullman –Bounds on the complexity of the longest Common Subsequence Problem, J. Assoc. Comput. Mach. , Vol. 23, No. 1, 1976.
  4. Biology, Cambridge University Press, New York, 1997. BioInformatics Educational Resources Documentation (online), European Bioinformatics Institute United Kingdom. Available: http://www. ebi. ac. uk/2can/tutorials/protein/align. html
  5. BLAST, http://blast. ncbi. nlm. nih. gov/Blast. cgi,
  6. DIALIGN, http://dialign. gobics. de
  7. Yinan Li , WHAM : A High Throughput Sequence Alignment Method , SIGMOID '11, June 12-16, 2011.
  8. Isokawa,M. Wayamaa,M. , and Shimizu T. 1996 . Multiple sequence alignment using a Genetic Algorithm. Proceedings of the Seventh Workshop on Genome Informatics, 7:176-177.
  9. Smith, T. F. and M. S. Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, 147:195-197, 1981.
  10. Needleman S, Wunsch. ,"A general method applicable to the search for similarities in the amino acid sequences of two proteins", J Mol Biol. 1970, 48:443-453.
  11. Rong X, Jan 2003, Pairwise Alignment - CS262 - Lecture 1 Notes(online), Stanford University. Available: http://ai. stanford. edu/~serafim/cs262/Spring2003/Notes/1. pdf
  12. Deitel P. and Deitel H. , Java How to Program, Prentice Hall, 2003.
  13. S. Nirmala Devi , "An Index based Pattern Matching using Multithreading ", International Journal of Computer Applications (0975 – 8887) Volume 50- No. 6, July 2012.
Index Terms

Computer Science
Information Sciences

Keywords

DNA operations sequence alignment Multithreading score

Powered by PhDFocusTM