### 抄録

We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is in form p ∧ _{α} q that are interpreted as cooperative patterns within α distance, and the other is in form p ∧ _{α} ¬q representing competing patterns, with respect to S. We show an efficient algorithm to find the optimal pair of patterns in O(N ^{2}) time using O(N) space. We also present an O(m ^{2}N ^{2}) time and O(m ^{2}N) space solution to a more difficult version of the optimal pattern pair discovery problem, where m denotes the number of strings in S.

元の言語 | 英語 |
---|---|

ページ（範囲） | 32-46 |

ページ数 | 15 |

ジャーナル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

巻 | 3245 |

出版物ステータス | 出版済み - 12 1 2004 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### これを引用

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,

*3245*, 32-46.

**Finding optimal pairs of cooperative and competing patterns with bounded distance.** / Inenaga, Shunsuke; Bannai, Hideo; Hyyrö, Heikki; Shinohara, Ayumi; Takeda, Masayuki; Nakai, Kenta; Miyano, Satoru.

研究成果: ジャーナルへの寄稿 › 記事

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, 巻. 3245, pp. 32-46.

}

TY - JOUR

T1 - Finding optimal pairs of cooperative and competing patterns with bounded distance

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Hyyrö, Heikki

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Nakai, Kenta

AU - Miyano, Satoru

PY - 2004/12/1

Y1 - 2004/12/1

N2 - We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is in form p ∧ α q that are interpreted as cooperative patterns within α distance, and the other is in form p ∧ α ¬q representing competing patterns, with respect to S. We show an efficient algorithm to find the optimal pair of patterns in O(N 2) time using O(N) space. We also present an O(m 2N 2) time and O(m 2N) space solution to a more difficult version of the optimal pattern pair discovery problem, where m denotes the number of strings in S.

AB - We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is in form p ∧ α q that are interpreted as cooperative patterns within α distance, and the other is in form p ∧ α ¬q representing competing patterns, with respect to S. We show an efficient algorithm to find the optimal pair of patterns in O(N 2) time using O(N) space. We also present an O(m 2N 2) time and O(m 2N) space solution to a more difficult version of the optimal pattern pair discovery problem, where m denotes the number of strings in S.

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

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

M3 - Article

VL - 3245

SP - 32

EP - 46

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -