Subsequence matching with gap-constraints is solvable in O(|D|(|u| + |C|)) time under left-convexity of the languages, optimal under SETH.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1