30 search results - page 3 / 6 » Cache-Oblivious Index for Approximate String Matching |
SPIRE
1998
Springer
13 years 10 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...
CPM
2000
Springer
13 years 10 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
IFIPTCS
2000
13 years 9 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 ...
ICDAR
2011
IEEE
12 years 5 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...
DASFAA
2003
IEEE
13 years 11 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...