Finding best patterns practically

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

研究成果: Chapter in Book/Report/Conference proceedingChapter

11 被引用数 (Scopus)

抄録

Finding a pattern which separates two sets is a critical task in discovery. Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. We generalize these problems to optimization problems, and give practical algorithms to solve them exactly. Our algorithms utilize some pruning heuristics based on the combinatorial properties of strings, and efficient data structures which recognize subsequence and episode patterns.

本文言語英語
ホスト出版物のタイトルProgress in Discovery Science
出版社Springer Verlag
ページ307-317
ページ数11
ISBN(印刷版)3540433384, 9783540433385
DOI
出版ステータス出版済み - 1 1 2002

出版物シリーズ

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

All Science Journal Classification (ASJC) codes

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

フィンガープリント

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

引用スタイル