54 search results - page 5 / 11 » A Dictionary-Based Compressed Pattern Matching Algorithm |
CONIELECOMP
2005
IEEE
14 years 1 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
JSS
2007
13 years 7 months ago
2007
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
SPIRE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
STACS
2009
Springer
14 years 2 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...