30 search results - page 1 / 6 » Cache-Oblivious Index for Approximate String Matching |
CPM
2007
Springer
15 years 18 days ago
2007
Springer
DASFAA
2009
IEEE
15 years 1 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
SPIRE
2007
Springer
15 years 16 days 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...
CPM
1999
Springer
14 years 10 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...