A practical algorithm to find the best episode patterns

Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationDiscovery Science - 4th International Conference, DS 2001, Proceedings
PublisherSpringer Verlag
Pages435-440
Number of pages6
Volume2226
ISBN (Print)9783540429562
Publication statusPublished - 2001
Event4th International Conference on Discovery Science, DS 2001 - Washington, United States
Duration: Nov 25 2001Nov 28 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2226
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Discovery Science, DS 2001
CountryUnited States
CityWashington
Period11/25/0111/28/01

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Hirao, M., Inenaga, S., Shinohara, A., Takeda, M., & Arikawa, S. (2001). A practical algorithm to find the best episode patterns. In Discovery Science - 4th International Conference, DS 2001, Proceedings (Vol. 2226, pp. 435-440). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2226). Springer Verlag.