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
EditorsKlaus P. Jantke, Ayumi Shinohara
PublisherSpringer Verlag
Pages435-440
Number of pages6
ISBN (Print)9783540429562
DOIs
Publication statusPublished - Jan 1 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)0302-9743
ISSN (Electronic)1611-3349

Other

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A practical algorithm to find the best episode patterns'. Together they form a unique fingerprint.

Cite this