45 search results - page 1 / 9 » Compressed Indexes for Approximate String Matching |
SPIRE
2007
Springer
15 years 13 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...
ALGORITHMICA
2010
14 years 6 months ago
2010
IFIPTCS
2000
14 years 10 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
VLDB
2005
ACM
14 years 11 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
CPM
2007
Springer
15 years 15 days ago
2007
Springer
