178 search results - page 18 / 36 » Fast Algorithms for Top-k Approximate String Matching |
83
Voted
JCB
2008
14 years 9 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
86
Voted
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
77
Voted
SPIRE
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
CPM
1999
Springer
15 years 1 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...