Efficient Fully-Compressed Sequence Representations
- 15 December 2012
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 69 (1) , 232-268
Abstract
No abstract availableKeywords
All Related Versions
This publication has 46 references indexed in Scilit:
- On compressing permutations and adaptive sortingTheoretical Computer Science, 2013
- New Lower and Upper Bounds for Representing Sequences2012
- Succinct indexes for strings, binary relations and multilabeled treesACM Transactions on Algorithms, 2011
- Alphabet-Independent Compressed Text IndexingLecture Notes in Computer Science, 2011
- Compressed Self-indices Supporting Conjunctive Queries on Document Collections2010
- Compact Rich-Functional Binary Relation Representations2010
- An experimental investigation of set intersection algorithms for text searchingACM Journal of Experimental Algorithmics, 2009
- Adaptive searching in succinctly encoded binary relations and tree-structured documentsTheoretical Computer Science, 2007
- The webgraph framework I2004
- Relevance ranking for one to three term queriesInformation Processing & Management, 2000