Recent advancements in parallel algorithms for string matching on computing models --- a survey and experimental results

  • Authors:
  • Chinta Someswararao;K. Butchi Raju;S. V. Appaji;S. Viswanadha Raju;K. K. V. V. V. S. Reddy

  • Affiliations:
  • Department of CSE, SRKR Engg College, Bhimavaram, AP, India;Department of CSE, GRIET, Hyderabad, AP, India;Department of CSE, GRIET, Hyderabad, AP, India;School of IT, JNTUH, Hyderabad, AP, India;Rayalasheema University, AP, India

  • Venue:
  • ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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. This work reviews typical algorithms and profiles their performance under various situations to study the influence of the number, the length, and the character distribution. This paper provides various available techniques that are suggested by several authors with its merits and demerits. In this we say that this survey will help the researchers to develop a better.