99 search results - page 4 / 20 » Speeding Up Pattern Matching by Text Compression |
CPM
1999
Springer
14 years 2 months ago
1999
Springer
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
CONIELECOMP
2005
IEEE
14 years 3 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...
DCC
2010
IEEE
14 years 1 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
WIA
2007
Springer
14 years 3 months ago
2007
Springer
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...