Parallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences

Abstract

The increase in huge amount of data is seen clearly in present days because of requirement for storing more information To extract certain data from this large database is a very difficult task including text processing information retrieval text mining pattern recognition and DNA sequencing So we need concurrent events and high performance computing models for extracting the data This will create a challenge to the researchers One of the solutions is parallel algorithms for string matching on computing models In this we implemented parallel string matching with JAVA Multi threading with multi core processing and performed a comparative study on Knuth Morris Pratt Boyer Moore and Brute force string matching algorithms For testing our system we take a gene sequence which consists of lacks of records From the test results it is shown that the multicore processing is better compared to lower versions Finally this proposed parallel string matching with multicore processing is better compared to other sequential approaches