108 search results - page 3 / 22 » Fast Convolutions and Their Applications in Approximate Stri... |
JDA
2010
13 years 3 months ago
2010
ISAAC
2001
Springer
13 years 10 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
PDPTA
2003
13 years 6 months ago
2003
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
GEOINFO
2007
13 years 6 months ago
2007
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
SPIRE
2005
Springer
13 years 11 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...