Sciweavers

540 search results - page 2 / 108
» A New Compression Method for Compressed Matching
Sort
View
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
ISPASS
2005
IEEE
14 years 1 months ago
Performance Analysis of a New Packet Trace Compressor based on TCP Flow Clustering
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...
Raimir Holanda, Javier Verdú, Jorge Garc&ia...
DCC
2004
IEEE
13 years 11 months ago
LZW Based Compressed Pattern Matching
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...
Tao Tao, Amar Mukherjee
ENC
2005
IEEE
14 years 1 months ago
Combining Structural and Textual Contexts for Compressing Semistructured Databases
We describe a compression technique for semistructured documents, called SCMPPM, which combines the Prediction by Partial Matching technique with Structural Contexts Model (SCM) t...
Joaquín Adiego, Pablo de la Fuente, Gonzalo...