Subsequences with gap constraints: complexity bounds for matching and analysis problems

DOI10.4230/LIPICS.ISAAC.2022.64MaRDI QIDQ6602491zbMATH OpenFDO

Authors Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid

Publication date 11 September 2024

zbMATH Keywords

pattern matchingstring algorithmsparameterised complexityconditional lower boundsfine-grained complexitysubsequences with gap constraints

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Subsequences with gap constraints: complexity bounds for matching and analysis problems

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