Matching of compressed patterns with character-variables

DOI10.4230/LIPICS.RTA.2012.272MaRDI QIDQ5111911zbMATHOpenAlexFDO

Authors Manfred Schmidt-Schauß

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.RTA.2012.272

zbMATH Keywords

matchinggrammar-based compressionpartial words

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Recommendations

• Algorithmics on SLP-compressed strings: a survey
• scientific article; zbMATH DE number 1839439
• scientific article; zbMATH DE number 1998342

Cited in

(5)

• Faster subsequence and don't-care pattern matching on compressed texts
• Approximation of smallest linear tree grammar
• Grammar-Based Tree Compression
• Finding characteristic substrings from compressed texts
• Detecting one-variable patterns

This page was built for publication: Matching of compressed patterns with character-variables

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