4 citations · 4 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
The Fine-Grained Complexity of Episode Matching
Philip Bille, Inge Li Gørtz, Shay Mozes +2
Given two strings and , the Episode Matching problem is to find the shortest substring of that contains as a subsequence. The best known upper bound for this problem…
cs.DS2021
Gapped Indexing for Consecutive Occurrences
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen +1
The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential…