34 search results - page 4 / 7 » Approximate String Matching with Reduced Alphabet |
SPIRE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
PDPTA
2003
14 years 11 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...
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
AIRS
2004
Springer
15 years 3 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
LATIN
1998
Springer
15 years 2 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...