A Practical Algorithm to Find the Best Episode Patterns

Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimization problem to find a best episode pattern that is common to one set but not common in the other set. The problem is known to be NP-hard. We give a practical algorithm to solve it exactly.

• Type: Conference
• Year: 2001
• Where: DIS
• Authors: Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
• Keywords: DIS 2001, Episode Pattern, Generalized Concept, Subsequence Pattern, Theoretical Computer Science