170 search results - page 7 / 34 » Algorithms on Compressed Strings and Arrays |
113
click to vote
LATA
2009
Springer
15 years 4 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
107
click to vote
CPM
1999
Springer
15 years 1 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...
DSD
2005
IEEE
15 years 3 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
103
click to vote
DCC
1992
IEEE
15 years 1 months ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...