55 search results - page 1 / 11 » Fast index for approximate string matching |
JDA
2010
13 years 3 months ago
2010
SPIRE
1998
Springer
13 years 9 months ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
DASFAA
2009
IEEE
13 years 11 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
13 years 11 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...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
