154 search results - page 15 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
105
click to vote
IFIPTCS
2000
15 years 3 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 ...
FCT
2003
Springer
15 years 4 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
109
click to vote
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
LATIN
1998
Springer
15 years 3 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
102
click to vote
CPM
1999
Springer
15 years 4 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...