Alphabet-Independent Compressed Text Indexing

DOI10.1145/2635816zbMath1398.68102OpenAlexW2074229180MaRDI QIDQ4962157

Djamal Belazzougui, Gonzalo Navarro

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/147721

zbMATH Keywords

compressionsuccinct data structuressuffix treestext indexing

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (13)

Compressed string dictionary search with edit distance one ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Succinct Non-overlapping Indexing ⋮ String Indexing with Compressed Patterns ⋮ Near-optimal search time in \(\delta \)-optimal space, and vice versa ⋮ Space-efficient construction of compressed suffix trees ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Fast compressed self-indexes with deterministic linear-time construction ⋮ Unnamed Item ⋮ Range majorities and minorities in arrays ⋮ Space-efficient computation of the LCP array from the Burrows-Wheeler transform ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ Tree path majority data structures

This page was built for publication: Alphabet-Independent Compressed Text Indexing