17 search results - page 2 / 4 » A General Practical Approach to Pattern Matching over Ziv-Le... |
CPM
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
NAACL
1994
13 years 6 months ago
1994
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...
STACS
2009
Springer
14 years 19 hour ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
FOCS
2009
IEEE
13 years 9 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
LREC
2008
13 years 6 months ago
2008
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...