Finding missing patterns

Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen

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

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.

本文言語英語
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編集者Inge Jonassen, Junhyong Kim
出版社Springer Verlag
ページ463-474
ページ数12
ISBN(印刷版)3540230181, 9783540230182
DOI
出版ステータス出版済み - 2004
外部発表はい

出版物シリーズ

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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

引用スタイル