Title :
A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences
Author :
Rizvi, S.A.M. ; Agarwal, Pankaj
Author_Institution :
Dept. of Comput. Sci., Jamia Millia Islamia Univ., New Delhi
Abstract :
This paper presents a new algorithm for finding longest common subsequence from two given sequences of DNA, proteins etc. of interest. Given algorithm is quite effective as far as time complexity is concerned. Our method compares the given database sequence of DNA representing the entire/partial genetic structure of some organism (such sequences are very long), which is assumed to be stored in the database only once with a given query sequence
Keywords :
biocomputing; computational complexity; genetics; proteins; query processing; DNA sequence; bucket-based algorithm; database sequence; entire organism genetic structure; longest common subsequence; molecular sequences; partial organism genetic structure; protein sequence; query sequence; time complexity; Computer science; DNA; Genetics; Indexes; Length measurement; Organisms; Proteins; Queueing analysis; Sequences; Spatial databases;
Conference_Titel :
Information Technology: New Generations, 2006. ITNG 2006. Third International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-2497-4
DOI :
10.1109/ITNG.2006.12
