A simple grammar-based index for finding approximately longest common substrings

DOI10.1007/978-3-031-43980-3_19MaRDI QIDQ6545431

Gonzalo Navarro, Travis Gagie, Sana Kashgouli

Publication date: 29 May 2024

zbMATH Keywords

grammar-based indexingalpha-balanced grammarsapproximately longest common substrings

Mathematics Subject Classification ID

Database theory (68P15) Grammars and rewriting systems (68Q42) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• LZ-ABT: a practical algorithm for \(\alpha \)-balanced grammar compression
• Universal compressed text indexing
• Time-space trade-offs for longest common extensions
• Grammar-compressed indexes with logarithmic search time
• The Smallest Grammar Problem
• Efficient randomized pattern-matching algorithms
• Grammar-based codes: a new class of universal lossless source codes
• Orthogonal range searching on the RAM, revisited

This page was built for publication: A simple grammar-based index for finding approximately longest common substrings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545431)