101 search results - page 13 / 21 » On String Matching in Chunked Texts |
FUN
2010
Springer
14 years 8 days ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
FOCS
2009
IEEE
13 years 11 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...
LATIN
1998
Springer
13 years 11 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...
ICDE
2002
IEEE
14 years 8 months ago
2002
IEEE
In this paper, we describe the design, architecture, and the lessons learned from the implementation of a fast regular expression indexing engine FREE. FREE uses a prebuilt index ...
SPIRE
2001
Springer
13 years 12 months ago
2001
Springer
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...