Finding best patterns practically

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

研究成果: 著書/レポートタイプへの貢献

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
ページ307-317
ページ数11
2281
出版物ステータス出版済み - 2002

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2281
ISSN(印刷物)03029743
ISSN(電子版)16113349

Fingerprint

Subsequence
Data structures
Strings
Pruning
Data Structures
NP-complete problem
Heuristics
Optimization Problem
Generalise

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

これを引用

Shinohara, A., Takeda, M., Arikawa, S., Hirao, M., Hoshino, H., & Inenaga, S. (2002). Finding best patterns practically. : Progress in Discovery Science (巻 2281, pp. 307-317). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2281).

Finding best patterns practically. / Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo; Hirao, Masahiro; Hoshino, Hiromasa; Inenaga, Shunsuke.

Progress in Discovery Science. 巻 2281 2002. p. 307-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 2281).

研究成果: 著書/レポートタイプへの貢献

Shinohara, A, Takeda, M, Arikawa, S, Hirao, M, Hoshino, H & Inenaga, S 2002, Finding best patterns practically. : Progress in Discovery Science. 巻. 2281, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 2281, pp. 307-317.
Shinohara A, Takeda M, Arikawa S, Hirao M, Hoshino H, Inenaga S. Finding best patterns practically. : Progress in Discovery Science. 巻 2281. 2002. p. 307-317. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Shinohara, Ayumi ; Takeda, Masayuki ; Arikawa, Setsuo ; Hirao, Masahiro ; Hoshino, Hiromasa ; Inenaga, Shunsuke. / Finding best patterns practically. Progress in Discovery Science. 巻 2281 2002. pp. 307-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inbook{49dc27f04a7242cea7530c9300155443,
title = "Finding best patterns practically",
abstract = "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.",
author = "Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa and Masahiro Hirao and Hiromasa Hoshino and Shunsuke Inenaga",
year = "2002",
language = "English",
isbn = "3540433384",
volume = "2281",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "307--317",
booktitle = "Progress in Discovery Science",

}

TY - CHAP

T1 - Finding best patterns practically

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Arikawa, Setsuo

AU - Hirao, Masahiro

AU - Hoshino, Hiromasa

AU - Inenaga, Shunsuke

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23044534938&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23044534938&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:23044534938

SN - 3540433384

SN - 9783540433385

VL - 2281

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 307

EP - 317

BT - Progress in Discovery Science

ER -