Abstract
Given q + 1 strings (a text t of length n and q patterns m 1 , … , m q ) and a natural number w, the multiple serial episode matching problem consists in finding the number of size w windows of text t which contain patterns m 1 , … , m q as subsequences, i.e., for each m i , if m i = p 1 , … , p k , the letters p 1 , … , p k occur in the window, in the same order as in m i , but not necessarily consecutively (they may be interleaved with other letters). Our main contribution here is an algorithm solving this problem on-line in time O ( n q ) with an MP-RAM model (which is a RAM model equipped with extra operations).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
