Title :
A new algorithm for local alignment in DNA sequencing
Author :
Das, Swagatam ; Dey, Debangshu
Author_Institution :
Dept. of Electron. & Telecommun. Eng., Jadavpur Univ., Calcutta, India
Abstract :
In recent years local alignment for DNA sequencing has obtained great significance. In this paper we propose an algorithm for local alignment between two DNA sequences and compare the performance of the proposed algorithm with Smith-Waterman algorithm. Complexity calculation shows that the proposed algorithm has a much less time complexity and requires very much less amount of memory storage than S-W algorithm.
Keywords :
DNA; biology computing; computational complexity; dynamic programming; molecular biophysics; sequences; DNA sequencing; Smith-Waterman algorithm; dynamic programming; local alignment; memory storage; time complexity; Algorithm design and analysis; DNA; Degradation; Dynamic programming; Heuristic algorithms; Informatics; Runtime; Sequences;
Conference_Titel :
India Annual Conference, 2004. Proceedings of the IEEE INDICON 2004. First
Print_ISBN :
0-7803-8909-3
DOI :
10.1109/INDICO.2004.1497784
