Space-efficient substring occurrence estimation

DOI10.1007/s00453-014-9936-yzbMath1336.68319OpenAlexW2124804277MaRDI QIDQ261345

Alessio Orlandi, Rossano Venturini

Publication date: 23 March 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9936-y

zbMATH Keywords

data structurespattern matchingcompressed full-text indexingfull-text indexing

Mathematics Subject Classification ID

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

Related Items

On the Value of Multiple Read/Write Streams for Data Compression, An Encoding for Order-Preserving Matching., Space-efficient substring occurrence estimation

Uses Software

• PATRICIA

Cites Work

• Unnamed Item
• Unnamed Item
• Space-efficient substring occurrence estimation
• Stronger Lempel-Ziv based compressed text indexing
• Compressed Cache-Oblivious String B-tree
• New Lower and Upper Bounds for Representing Sequences
• Compressed representations of sequences and full-text indexes
• Alphabet Partitioning for Compressed Rank/Select and Applications
• The string B-tree
• The compressed permuterm index
• Cache-Oblivious Algorithms
• An analysis of the Burrows—Wheeler transform
• Indexing compressed text
• Fast Prefix Search in Little Space, with Applications
• Algorithms on Strings, Trees and Sequences
• Efficient Storage and Retrieval by Content and Address of Static Files
• Compressed text indexes
• Fully-Compressed Suffix Trees
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching