Software—Practice & Experience
Compact pat trees
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
Lightweight natural language text compression
Information Retrieval
ACM Computing Surveys (CSUR)
A simple storage scheme for strings achieving entropy bounds
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Variable-length Codes for Data Compression
Variable-length Codes for Data Compression
Dynamic entropy-compressed sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
An(other) Entropy-Bounded Compressed Suffix Tree
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
Practical Rank/Select Queries over Arbitrary Sequences
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Compressed dictionaries: space measures, data sets, and experiments
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Sampled longest common prefix array
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Compressed string dictionaries
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Interpolative coding of integer sequences supporting log-time random access
Information Processing and Management: an International Journal
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Variable length compression for bitmap indices
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Computing the longest common prefix array based on the burrows-wheeler transform
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Practical representations for web and social graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Super-Linear indices for approximate dictionary searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Generalized biwords for bitext compression and translation spotting
Journal of Artificial Intelligence Research
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
Compressed suffix trees for repetitive texts
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Improved address-calculation coding of integer arrays
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Variable-Length codes for space-efficient grammar-based compression
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms
On compressing and indexing repetitive sequences
Theoretical Computer Science
Generalized biwords for bitext compression and translation spotting: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i -th codeword without need of any sampling method. The technique is practical and has many applications to the representation of ordered sets, sparse bitmaps, partial sums, and compressed data structures for suffix trees, arrays, and inverted indexes, to name just a few. We show experimentally that the technique offers a competitive alternative to other data structures that handle this problem.