Parallel Smith-Waterman Algorithm for Gene Sequencing

Main Article Content

Deepa. B. C., Nagaveni. V


Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system development for biological gene sequence. The research work here gives a deep understanding and knowledge transfer about exiting approach for gene sequencing and alignment using Smith-waterman their strength and weaknesses. Smith-Waterman algorithm calculates the local alignment of two given sequences used to identify similar RNA, DNA and protein segments. To identify the enhanced local alignments of biological gene pairs Smith-Waterman algorithm uses dynamic programming approach. It is proficient in finding the optimal local alignment considering the given scoring system.
DOI: 10.17762/ijritcc2321-8169.1505157

Article Details

How to Cite
, D. B. C. N. V. “Parallel Smith-Waterman Algorithm for Gene Sequencing”. International Journal on Recent and Innovation Trends in Computing and Communication, vol. 3, no. 5, May 2015, pp. 3237-40, doi:10.17762/ijritcc.v3i5.4427.