108 search results - page 5 / 22 » Families of FPGA-Based Algorithms for Approximate String Mat... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
ALENEX
2007
13 years 10 months ago
2007
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
JSA
2008
13 years 8 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...
RSA
2002
13 years 8 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
ALGORITHMICA
2005
13 years 8 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...