170 search results - page 9 / 34 » Algorithms on Compressed Strings and Arrays |
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
CPM
2001
Springer
15 years 2 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...
75
Voted
ICARIS
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
SCCC
2002
IEEE
15 years 2 months ago
2002
IEEE
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...