Distribution-aware compressed full-text indexes
DOI10.1007/s00453-013-9782-3zbMath1308.68058OpenAlexW2593228764MaRDI QIDQ2017875
Rossano Venturini, Jouni Sirén, Paolo Ferragina
Publication date: 23 March 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/27658
Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
- Compressed representations of sequences and full-text indexes
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Alphabet-Independent Compressed Text Indexing
- Distribution-Aware Compressed Full-Text Indexes
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Mining Query Logs: Turning Search Usage Data into Knowledge
- Indexing compressed text
- The Least Weight Subsequence Problem
- The concave least-weight subsequence problem revisited
- Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
- New text indexing functionalities of the compressed suffix arrays
- Compressed text indexes
This page was built for publication: Distribution-aware compressed full-text indexes