34 search results - page 3 / 7 » RMESH Algorithms for Parallel String Matching |
JSA
2008
13 years 9 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
CSB
2005
IEEE
14 years 3 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
The security of your data and of your network is in the hands of intrusion detection systems, virus scanners and spam filters, which are all critically based on string matching. ...