273 search results - page 18 / 55 » Compressed String Dictionaries |
DATESO
2007
13 years 9 months ago
2007
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transfor...
CPM
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
