MOTIF SEARCH METHOD AND MOTIF SEARCH APPARATUS

摘要

Provided are a novel method and apparatus for searching for an aptamer candidate, in which sequence information is acquired from a round pool that is not fully concentrated and a desired aptamer candidate is sought, this method serving as a countermeasure to self-overlapping and as an alternative to the method of Sinha et al. The aptamer candidate search method comprises the following steps (A) to (F): (A) a first motif candidate listing step in which first motif candidate sequences contained within a certain range are listed when the minimum length of a motif sequence to be sought is defined as (l_min),the maximum length of the motif sequence to be sought is defined as (l_max), and said range of the length (l) of the motif to be sought is defined as [l_min, l_max]; (B) a second motif candidate selection step in which a second motif candidate sequence is selected from the first motif candidate sequences listed in step (A); (C) a motif candidate amendment step in which the second motif candidate sequence selected in step (B) is amended; (D) a motif determining step in which the second motif candidate sequence amended in step (C) is determined as a motif to be sought; and (F) an aptamer candidate determining step in which a base sequence including the motif determined in step (D) is determined as an aptamer candidate.