# Finding missing patterns

Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen

6 引用 (Scopus)

### 抄録

Consider the following problem: Find the shortest pattern that does not occur in a given text. To make the problem non-trivial, the pattern is required to consist only of characters that occur in the text. This problem can be solved easily in linear time using the suffix tree of the text. In this paper, we study an extension of this problem, namely 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 a. We show that the missing patterns problem can be solved in O(min(αn log n, n2)) time, where n is the size of the text. For the special case where both pairs are required to have the same length, we give an algorithm with time complexity O(αn log log n). The problem is motivated by optimization of multiplexed nested-PCR.

元の言語 英語 463-474 12 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3240 出版済み - 12 1 2004 Yes

Suffix Tree
Time Complexity
Linear Time
Text
Optimization
Character

### All Science Journal Classification (ASJC) codes

• Theoretical Computer Science
• Computer Science(all)

### これを引用

Finding missing patterns. / Inenaga, Shunsuke; Kivioja, Teemu; Mäkinen, Veli.

：: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻 3240, 01.12.2004, p. 463-474.

@article{11e2c8be275b448e94b15d2f403c45a1,
title = "Finding missing patterns",
abstract = "Consider the following problem: Find the shortest pattern that does not occur in a given text. To make the problem non-trivial, the pattern is required to consist only of characters that occur in the text. This problem can be solved easily in linear time using the suffix tree of the text. In this paper, we study an extension of this problem, namely 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 a. We show that the missing patterns problem can be solved in O(min(αn log n, n2)) time, where n is the size of the text. For the special case where both pairs are required to have the same length, we give an algorithm with time complexity O(αn log log n). The problem is motivated by optimization of multiplexed nested-PCR.",
author = "Shunsuke Inenaga and Teemu Kivioja and Veli M{\"a}kinen",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3240",
pages = "463--474",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Finding missing patterns

AU - Inenaga, Shunsuke

AU - Kivioja, Teemu

AU - Mäkinen, Veli

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Consider the following problem: Find the shortest pattern that does not occur in a given text. To make the problem non-trivial, the pattern is required to consist only of characters that occur in the text. This problem can be solved easily in linear time using the suffix tree of the text. In this paper, we study an extension of this problem, namely 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 a. We show that the missing patterns problem can be solved in O(min(αn log n, n2)) time, where n is the size of the text. For the special case where both pairs are required to have the same length, we give an algorithm with time complexity O(αn log log n). The problem is motivated by optimization of multiplexed nested-PCR.

AB - Consider the following problem: Find the shortest pattern that does not occur in a given text. To make the problem non-trivial, the pattern is required to consist only of characters that occur in the text. This problem can be solved easily in linear time using the suffix tree of the text. In this paper, we study an extension of this problem, namely 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 a. We show that the missing patterns problem can be solved in O(min(αn log n, n2)) time, where n is the size of the text. For the special case where both pairs are required to have the same length, we give an algorithm with time complexity O(αn log log n). The problem is motivated by optimization of multiplexed nested-PCR.

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

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

M3 - Article

AN - SCOPUS:33646730028

VL - 3240

SP - 463

EP - 474

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -