Compact Recognizers of Episode Sequences
- 1 May 2002
- journal article
- Published by Elsevier in Information and Computation
- Vol. 174 (2) , 180-192
- https://doi.org/10.1006/inco.2002.3143
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximate string-matching over suffix treesPublished by Springer Nature ,2005
- Episode matchingPublished by Springer Nature ,1997
- Discovery of Frequent Episodes in Event SequencesData Mining and Knowledge Discovery, 1997
- Fast approximate matching using suffix treesPublished by Springer Nature ,1995
- Searching subsequencesTheoretical Computer Science, 1991
- The longest common subsequence problem revisitedAlgorithmica, 1987
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981