Cadences in grammar-compressed strings

DOI10.1007/978-3-030-68195-1_26OpenAlexW3135349211MaRDI QIDQ2232293

Julian Pape-Lange

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2008.05594

zbMATH Keywords

string algorithmscompressed pattern matchingstring-cadences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• String cadences
• Faster Fully Compressed Pattern Matching by Recompression
• The Smallest Grammar Problem
• The Compressed Word Problem for Groups
• Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

This page was built for publication: Cadences in grammar-compressed strings