A practical algorithm to find the best episode patterns

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

研究成果: Conference contribution

17 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルDiscovery Science - 4th International Conference, DS 2001, Proceedings
編集者Klaus P. Jantke, Ayumi Shinohara
出版社Springer Verlag
ページ435-440
ページ数6
ISBN(印刷版)9783540429562
DOI
出版ステータスPublished - 2001 1 1
外部発表はい
イベント4th International Conference on Discovery Science, DS 2001 - Washington, United States
継続期間: 2001 11 252001 11 28

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2226
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other4th International Conference on Discovery Science, DS 2001
国/地域United States
CityWashington
Period01/11/2501/11/28

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A practical algorithm to find the best episode patterns」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル