Compressed representations of sequences and full-text indexes
Work
Year: 2007
Type: article
Abstract: Given a sequence S = s 1 s 2 … s n of integers smaller than r = O (polylog( n )), we show how S can be represented using nH 0 ( S ) + o ( n ) bits, so that we can know any s q , as well as answer rank... more
Source: ACM Transactions on Algorithms
Institutions University of Pisa, Università degli Studi del Piemonte Orientale “Amedeo Avogadro”, University of Helsinki, University of Chile
Cites: 54
Cited by: 383
Related to: 10
FWCI: 46.14
Citation percentile (by year/subfield): 98.65
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green