Distribution-aware compressed full-text indexes

DOI10.1007/S00453-013-9782-3MaRDI QIDQ2017875zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina, Jouni Sirén, Rossano Venturini

Publication date 23 March 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10138/27658

zbMATH Keywords

dynamic programmingfull-text indexingsuccinct data structurescompressed full-text indexes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Distribution-aware compressed full-text indexes
• Indexing compressed text
• Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices
• Space-efficient construction of Lempel-Ziv compressed text indexes
• Compressed representations of sequences and full-text indexes

Cites work

• scientific article; zbMATH DE number 1688373 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• Alphabet partitioning for compressed rank/select and applications
• Alphabet-independent compressed text indexing
• Compressed representations of sequences and full-text indexes
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed text indexes, from theory to practice
• Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
• Distribution-aware compressed full-text indexes
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
• Indexing compressed text
• Mining query logs: turning search usage data into knowledge
• New text indexing functionalities of the compressed suffix arrays
• The Least Weight Subsequence Problem
• The concave least-weight subsequence problem revisited

Cited in

(5)

• Improved and extended locating functionality on compressed suffix arrays
• Distribution-aware compressed full-text indexes
• Engineering a Distributed Full-Text Index
• Fragmented BWT: an extended BWT for full-text indexing
• Parallel and distributed compressed indexes

This page was built for publication: Distribution-aware compressed full-text indexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017875)