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
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Online Construction of Subsequence Automata for Multiple Texts
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Discovering Best Variable-Length-Don't-Care Patterns
DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Best Patterns Practically
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
The Minimum DAWG for All Suffixes of a String and Its Applications
CPM '02 Proceedings of the 13th 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
Multiple serial episodes matching
Information Processing Letters
Mining minimal distinguishing subsequence patterns with gap constraints
Knowledge and Information Systems
Unsupervised pattern mining from symbolic temporal data
ACM SIGKDD Explorations Newsletter - Special issue on data mining for health informatics
Multiple serial episodes matching
Information Processing Letters
Discovering episodes with compact minimal windows
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
The episode matching problem is considered and the method for preprocessing the text is presented. Once the text is preprocessed, an episode substring can be found in time linear to the length of pattern (episode).