抄録
In this paper, we study the missing patterns problem: Find the shortest pair of patterns that do not occur close to each other in a given text, i.e., the distance between their occurrences is always greater than a given threshold α. We present various solutions to this problem, as well as to the case where the patterns in the pair are required to be of the same length. This work is motivated by optimizing the sensitivity of PCR. Experiments show that our algorithm is practical enough to handle human genome data.
| 元の言語 | 英語 |
|---|---|
| ページ（範囲） | 153-165 |
| ページ数 | 13 |
| ジャーナル | Journal of Discrete Algorithms |
| 巻 | 9 |
| 発行部数 | 2 |
| DOI | |
| 出版物ステータス | 出版済み - 6 1 2011 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
これを引用
Missing pattern discovery. / Angelov, Stanislav; Inenaga, Shunsuke; Kivioja, Teemu; Mäkinen, Veli.
：: Journal of Discrete Algorithms, 巻 9, 番号 2, 01.06.2011, p. 153-165.研究成果: ジャーナルへの寄稿 › 記事
}
TY - JOUR
T1 - Missing pattern discovery
AU - Angelov, Stanislav
AU - Inenaga, Shunsuke
AU - Kivioja, Teemu
AU - Mäkinen, Veli
PY - 2011/6/1
Y1 - 2011/6/1
N2 - In this paper, we study the missing patterns problem: Find the shortest pair of patterns that do not occur close to each other in a given text, i.e., the distance between their occurrences is always greater than a given threshold α. We present various solutions to this problem, as well as to the case where the patterns in the pair are required to be of the same length. This work is motivated by optimizing the sensitivity of PCR. Experiments show that our algorithm is practical enough to handle human genome data.
AB - In this paper, we study the missing patterns problem: Find the shortest pair of patterns that do not occur close to each other in a given text, i.e., the distance between their occurrences is always greater than a given threshold α. We present various solutions to this problem, as well as to the case where the patterns in the pair are required to be of the same length. This work is motivated by optimizing the sensitivity of PCR. Experiments show that our algorithm is practical enough to handle human genome data.
UR - http://www.scopus.com/inward/record.url?scp=79952359450&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952359450&partnerID=8YFLogxK
U2 - 10.1016/j.jda.2010.08.005
DO - 10.1016/j.jda.2010.08.005
M3 - Article
AN - SCOPUS:79952359450
VL - 9
SP - 153
EP - 165
JO - Journal of Discrete Algorithms
JF - Journal of Discrete Algorithms
SN - 1570-8667
IS - 2
ER -