Efficient Parallel Pattern Matching Using Partition Method

Author

Raju, S. Viswanadha ; Mantena, S.R. ; Babu, A. Vinaya ; Raju, G.V.S.

Author_Institution

Dept of C.S.E., GRIET, Hyderabad

fYear

2006

fDate

Dec. 2006

Firstpage

427

Lastpage

430

Abstract

In this paper we consider the problem of exact string matching algorithm based on a two-dimensional array. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by finding common characters in pattern string which achieves a constant time O(1) for pattern string in a text string . This reduces many calls across backend interface

Keywords

Boolean algebra; string matching; Boolean matrix; parallel pattern matching; partition method; string matching; two-dimensional array; Computational biology; Computer networks; Concurrent computing; Databases; Distributed computing; Information retrieval; Matrix decomposition; Parallel processing; Pattern matching; Sequences; Arrays; Boolean matrix; Cellular automata; String matching.;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2006. PDCAT '06. Seventh International Conference on

Conference_Location

Taipei

Print_ISBN

0-7695-2736-1

Type

conf

DOI

10.1109/PDCAT.2006.60

Filename

4032220

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2928283