54 search results - page 6 / 11 » Multiple Pattern Matching in LZW Compressed Text |
117
click to vote
RSA
2002
15 years 1 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
123
Voted
STACS
2009
Springer
15 years 8 months 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...
135
click to vote
IFIPTCS
2000
15 years 5 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 ...
130
click to vote
CCP
2011
14 years 1 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...