摘要

Pattern matching plays an important role in various applications ranging from text searching in word processors to identification of functional and structural behavior in proteins and genes. Pattern matching is one of the fundamental areas in the field of computational biology. Currently research in life science area is producing large amount of genetic data. Due to this large and use full information can be gained by finding valuable information available from the genomic sequences. Many algorithms have been proposed but more efficient and robust methods are needed for the multiple pattern matching algorithms for better use. We introduce a new indexing technique called an Index based even odd multiple pattern matching, which gives very good performance when compared with some of the existing popular algorithms. The current technique avoids unnecessary DNA comparisons as a result the number of comparisons and CPC ratio gradually decreases and overall performance increases accordingly.

  • 出版日期2011

全文