A parameterized study of maximum generalized pattern matching problems

DOI10.1007/978-3-319-13524-3_23MaRDI QIDQ6826282zbMATH OpenFDO

Authors Sebastian Ordyniak, Alexandru Popa

Publication date 15 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13524-3_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

This page was built for publication: A parameterized study of maximum generalized pattern matching problems

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