Multiple serial episode matchingReport as inadecuate

Multiple serial episode matching - Download this document for free, or read online. Document in PDF available to download.

1 LACL - Laboratoire d-Algorithmique Complexité et Logique 2 LIAFA - Laboratoire d-informatique Algorithmique : Fondements et Applications 3 PDMI - Steklov Institute of Mathematiks

Abstract : In a previous paper we generalized the Knuth-Morris-Pratt KMP pattern matching algorithm and defined a non-conventional kind of RAM, the MP-RAMs RAMS equipped with extra operations, and designed an $On$ on-line algorithm for solving the serial episode matching problem on MP-RAMs when there is only one single episode. We here give two extensions of this algorithm to the case when we search for several patterns simultaneously and compare them. More preciseley, given $q+1$ strings a text $t$ of length $n$ and $q$ patterns $m 1,\ldots,m q$ and a natural number $w$, the {\em multiple serial episode matching problem} consists in finding the number of size $w$ windows of text $t$ which contain patterns $m 1,\ldots,m q$ as subsequences, i.e. for each $m i$, if $m i=p 1,\ldots ,p k$, the letters $p 1,\ldots ,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.} The main contribution is an algorithm solving this problem on-line in time $Onq$.

Keywords : datamining Subsequence matching algorithms frequent patterns episode matching datamining.

Author: Patrick Cegielski - Irene Guessarian - Yuri Matiyasevich -



Related documents