Location of Repository

## Multiple serial episode matching

### Abstract

12In 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 $O(n)$ 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 $O(nq)$

Topics: datamining, Subsequence matching, algorithms, frequent patterns, episode matching, datamining., F.2.2., [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Publisher: The National Academy of Sciences of Armenia Publishers
Year: 2005
OAI identifier: oai:HAL:hal-00020564v1
Provided by: Hal-Diderot
Sorry, we are unable to provide the full text but you may find it at the following location(s):
• ### Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.