Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems

Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid. Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. In Sang Won Bae, Heejin Park, editors, 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. Volume 248 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.