Dynamic Entropy-Compressed Sequences and Full-Text Indexes

Dynamic Entropy-Compressed Sequences and Full-Text Indexes

Cached

Download Links

by Veli Mäkinen , Gonzalo Navarro

Citations:

BibTeX

@MISC{Mäkinen_dynamicentropy-compressed,
    author = {Veli Mäkinen and Gonzalo Navarro},
    title = {Dynamic Entropy-Compressed Sequences and Full-Text Indexes},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

574	Text Compression - Bell, Cleary, et al. - 1990
560	G: Suffix arrays: a new method for on-line string searches - Manber, Myers - 1993
461	D: A block-sorting lossless data compression algorithm - Burrows, Wheeler - 1994
427	Information retrieval data structures and algorithms - Frakes, Baeza-Yates - 1992
283	Universal codeword sets and representations of the integers - Elias - 1975
172	Compressed suffix arrays and suffix trees with applications to text indexing and string matching - GROSSI, S
163	High-order entropy-compressed text indexes - Grossi, Gupta, et al. - 2003
149	S: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets - Raman, Raman, et al.
142	G: Opportunistic data structures with applications - Ferragina, Manzini
142	Compressed full text indexes - Navarro, Mäkinen
114	An analysis of the Burrows-Wheeler transform - Manzini
110	The myriad virtues of subword trees - Apostolico - 1985
93	Manzini G: Indexing compressed text - Ferragina
92	G.: Compressed representations of sequences and full-text indexes - Ferragina, Manzini, et al. - 2010
60	Indexing text using the Ziv-Lempel trie - Navarro - 2004
46	Succinct suffix arrays based on run-length encoding - MÄKINEN, G
44	Breaking a time-and-space barrier in constructing full-text indices - Hon, Sadakane, et al. - 2003
43	Rank/select operations on large alphabets: a tool for text indexing - Golynski, Munro, et al. - 2006
40	When indexing equals compression: experiments with compressing suffix arrays and applications - Grossi, Gupta, et al. - 2004
37	Optimal algorithms for list indexing and subset rank - Dietz - 1989
29	A simple storage scheme for strings achieving entropy bounds, Theoretical Computer Science 371 - Ferragina, Venturini - 2007
29	Rank and select revisited and extended - Mäkinen, Navarro - 2007
26	Succinct dynamic data structures - Raman, Raman, et al. - 2001
22	Compressed indexes for dynamic text collections - Chan, Hon, et al.
22	Statistical encoding of succinct data structures - González, Navarro - 2006
21	A theoretical and experimental study on the construction of suffix arrays in external memory - Crauser, Ferragina - 2002
21	Constructing compressed suffix arrays with large alphabets - HON, LAM, et al. - 2003
19	Compressed data structures: Dictionaries and data-aware measures - Gupta, Hon, et al.
19	Succinct data structures for searchable partial sums - Hon, Sadakane, et al.
18	Compact representations of ordered sets - Blanford, Blelloch - 2004
18	Low redundancy in dictionaries with O(1) worst case lookup time - Pagh - 1999
17	The myriad virtues of wavelet trees - Ferragina, Giancarlo, et al.
16	Compressed index for a dynamic collection of texts - CHAN, HON, et al. - 2004
16	Tight bounds for the partial-sums problem - Pǎtras¸cu, Demaine - 2004
14	Space-efficient construction of LZ-index - Arroyuelo, Navarro - 2005
13	Fast BWT in small space by blockwise suffix sorting - Kärkkäinen
11	Compression boosting in optimal linear time using the Burrows-Wheeler transform - Ferragina, Manzini - 2004
5	Rank and select revisited and extended, Theoretical Computer Science 387 - Mäkinen, Navarro - 2007
5	Extended version as - appear - 1995
3	Dynamic rank/select dictionaries with applications to XML indexing - Gupta, Hon, et al.
1	Dynamic Entropy-Compressed Sequences * 39 - Ferragina, Giancarlo, et al. - 2006
1	Static and dynamic rank-select dictionaries for run-length encoded texts - Lee, Park - 2007
1	Month 20YY. Entropy-Compressed Sequences · 39 - No - 2007