SPIRE
2000
Springer
13 years 8 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
DCC
2004
IEEE
13 years 8 months ago
2004
IEEE
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...
CSB
2004
IEEE
13 years 8 months ago
2004
IEEE
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 ...
CPM
1999
Springer
13 years 8 months ago
1999
Springer
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
CPM
2000
Springer
13 years 8 months ago
2000
Springer
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...
CIAC
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
CPM
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
COMPSAC
2002
IEEE
13 years 9 months ago
2002
IEEE
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...