540 search results - page 10 / 108 » A New Compression Method for Compressed Matching |
CSB
2002
IEEE
15 years 2 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
CPM
2000
Springer
15 years 2 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...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
We propose a new variable-sized-block method for VLIW code compression. Code compression traditionally works on fixed-sized blocks and its efficiency is limited by the small block...
STACS
2009
Springer
15 years 4 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...