An experimental study of a compressed index

DOI10.1016/S0020-0255(01)00098-6zbMath1031.68536OpenAlexW2037089206WikidataQ126594530 ScholiaQ126594530MaRDI QIDQ5944434

Paolo Ferragina, Giovanni Manzini

Publication date: 10 October 2001

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00098-6

zbMATH Keywords

Burrows-Wheeler transformcompressed full-text indexpattern matching on compressed text

Mathematics Subject Classification ID

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

Related Items

A simple optimal representation for balanced parentheses, Fast decoding algorithms for variable-lengths codes, Resolution cannot polynomially simulate compressed-BFS, An Encoding for Order-Preserving Matching.

Uses Software

• Canterbury
• GLIMPSE

Cites Work

• Let sleeping files lie: Pattern matching in Z-compressed files.
• String matching in Lempel-Ziv compressed strings
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• A locally adaptive data compression scheme
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item