loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06)
Efficient Parallel Pattern Matching Using Partition Method
Taipei, Taiwan
December 04-December 07
ISBN: 0-7695-2736-1
ASCII Text
x 
 
S. Viswanadha Raju, S.R. Mantena, A. Vinaya Babu, G.V.S. Raju, "Efficient Parallel Pattern Matching Using Partition Method," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 427-430, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2006.60,
author = {S. Viswanadha Raju and S.R. Mantena and A. Vinaya Babu and G.V.S. Raju},
title = {Efficient Parallel Pattern Matching Using Partition Method},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2736-1},
pages = {427-430},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2006.60},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - Efficient Parallel Pattern Matching Using Partition Method
SN - 0-7695-2736-1
SP427
EP430
A1 - S. Viswanadha Raju,
A1 - S.R. Mantena,
A1 - A. Vinaya Babu,
A1 - G.V.S. Raju,
PY - 2006
KW - Arrays
KW - Boolean matrix
KW - Cellular automata
KW - String matching.
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
S. Viswanadha Raju, GRIET, India
S.R. Mantena, GRIET, India
A. Vinaya Babu, J.N.T. University, India
G.V.S. Raju, J.E.C., India
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.
Index Terms:
Arrays, Boolean matrix, Cellular automata, String matching.
Citation:
S. Viswanadha Raju, S.R. Mantena, A. Vinaya Babu, G.V.S. Raju, "Efficient Parallel Pattern Matching Using Partition Method," pdcat, pp.427-430, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.