2-Jump DNA Search Multiple Pattern Matching Algorithm
Pattern matching in a DNA sequence or searching a pattern from a large data base is a major research area in computational biology. To extract pattern match from a large sequence it takes more time, in order to reduce searching time we have proposed an approach that reduces the search time with accurate retrieval of the matched pattern in the sequence. As performance plays a major role in extracting patterns from a given DNA sequence or from a database independent of the size of the sequence. When sequence databases grow, more efficient approaches to multiple matching are becoming more important. One of the major problems in genomic field is to perform pattern comparison on DNA and protein sequences. Executing pattern comparison on the DNA and protein data is a computationally intensive task. In the current approach we explore a new technique which avoids unnecessary comparisons in the DNA sequence called 2-jump DNA search multiple pattern matching algorithm for DNA sequences. The proposed technique gives very good performance related to DNA sequence analysis for querying of publicly available genome sequence data. By using this method the number of comparisons gradually decreases and comparison per character ratio of the proposed algorithm reduces accordingly when compared to the some of the existing popular methods. The experimental results show that there is considerable amount of performance improvement due to this the overall performance increases.
Keywords: Characters, matching, patterns, sequence
Download Full-Text
