Abstract
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.
Cite
CITATION STYLE
Hirao, M., Inenaga, S., Shinohara, A., Takeda, M., & Arikawa, S. (2001). A practical algorithm to find the best episode patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2226, pp. 435–440). Springer Verlag. https://doi.org/10.1007/3-540-45650-3_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
