3270 search results - page 18 / 654 » Approximate String Processing |
SPIRE
2007
Springer
14 years 1 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...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
PDPTA
2003
13 years 9 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...
IJFCS
2002
13 years 7 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
APPROX
2004
Springer
14 years 29 days ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...