154 search results - page 7 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
ISPAN
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
CPM
1997
Springer
15 years 1 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
CORR
2010
Springer
14 years 9 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...
83
Voted
JSA
2008
14 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...