An Index based Pattern Matching using Multithreading

Pattern matching, the problem of finding sub sequences within a long sequence is essential for many applications such as information retrieval, disease analysis, structural and functional analysis, logic programming, theorem-proving, term rewriting and DNA-computing. In computational biology the ess...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2012-01, Vol.50 (6), p.13-17
Main Authors: Devi, S Nirmala, Rajagopalan, S P
Format: Article
Language:English
Subjects:
Algorithms
Deoxyribonucleic acid
Logic programming
Matching
Searching
String matching
Texts
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Pattern matching, the problem of finding sub sequences within a long sequence is essential for many applications such as information retrieval, disease analysis, structural and functional analysis, logic programming, theorem-proving, term rewriting and DNA-computing. In computational biology the essential components for DNA applications is the exact string matching algorithms. Many databases like GenBank were built by researchers for DNA and protein sequences; the string matching problem is the core problem for searching these databases. As the size of the database grows, the more important research area is to design an efficient string matching algorithms. This paper proposes a new pattern matching technique called An Index based Pattern matching using Multithreading for DNA sequences. The method specified in this paper performs parallel string searching using multiple threads simultaneously, each thread is responsible for searching one part of the text. . The proposed algorithm is an efficient algorithm that can be used to search for exact occurrences of patterns in DNA sequences.
ISSN:0975-8887
0975-8887
DOI:10.5120/7774-0857