Theoretical Computer Science
Window-accumulated subsequence matching problem is linear
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compact recognizers of episode sequences
Information and Computation
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Finding Best Patterns Practically
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A Practical Algorithm to Find the Best Episode Patterns
DS '01 Proceedings of the 4th International Conference on Discovery Science
Directed acyclic subsequence graph: overview
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Given two strings, pattern P and text T, episode substring of P in T is a minimal substring of T that contains P as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very quickly. With the structure, we can find for example all episode substrings or the shortest episode substring in O(mw) time where m is the length of the pattern and w is the number of episode substrings found.