@InProceedings{day_et_al:LIPIcs.ISAAC.2022.64,
author = {Day, Joel D. and Kosche, Maria and Manea, Florin and Schmid, Markus L.},
title = {{Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {64:1--64:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.64},
URN = {urn:nbn:de:0030-drops-173493},
doi = {10.4230/LIPIcs.ISAAC.2022.64},
annote = {Keywords: String algorithms, subsequences with gap constraints, pattern matching, fine-grained complexity, conditional lower bounds, parameterised complexity}
}