Originating from the work of Navarro and Thankachan [TCS 2016], the problem of consecutive pattern matching is a variant of the fundamental pattern matching problem, where one is given a text and a pair of patterns, and must compute their consecutive occurrences in the text. Assuming that the text is given as a straight-line program, we develop an algorithm that computes all consecutive occurrences in optimal time.
No takes yet. Share an insight, caveat, or question.
Gawrychowski et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: