Block graphs in practice

DOI10.1007/S11786-016-0286-9zbMath1409.68091OpenAlexW2584327637MaRDI QIDQ2363994

Christopher Hoobin, Travis Gagie, Simon J. Puglisi

Publication date: 17 July 2017

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Finger search in grammar-compressed strings

Cites Work

• Unnamed Item
• On compressing and indexing repetitive sequences
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Random Access to High-Order Entropy Compressed Text
• Faster Approximate Pattern Matching in Compressed Repetitive Texts
• Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
• The Smallest Grammar Problem
• Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Practical Entropy-Compressed Rank/Select Dictionary

This page was built for publication: Block graphs in practice