Distribution-aware compressed full-text indexes

DOI10.1007/S00453-013-9782-3zbMATH Open1308.68058OpenAlexW2593228764MaRDI QIDQ2017875FDOQ2017875

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

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

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)

Cites Work

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

Cited In (5)

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

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)