A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Compact Recognizers of Episode Sequences
2002
Information and Computation
Given two strings T = a 1 : : : a n and P = b 1 : : : b m over an alphabet , the problem of testing whether P occurs as a subsequence of T is trivially solved in linear time. It is also known that a simple O(n log j j) time preprocessing of T makes it easy to decide subsequently for any P and in at most jP j logj j character comparisons, whether P is a subsequence of T . These problems become more complicated if one asks instead whether P occurs as a subsequence of some substring Y of T of
doi:10.1006/inco.2002.3143
fatcat:kido2ngxsjae3fkk46ghed4scq