Dynamic neighborhood searches for thermodynamically designing DNA sequence

Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

10 被引用数 (Scopus)


We present a local search based algorithm designing DNA short-sequence sets satisfying thermodynamical constraints about minimum free energy (MFE) criteria. In DNA12, Kawashimo et al. propose a dynamic neighborhood search algorithm for the sequence design under hamming distance based constraints, where an efficient search is achieved by dynamically controlling the neighborhood structures. Different from the hamming distance based constraints, the thermodynamical constraints are generally difficult to handle in local-search type algorithms. This is because they require a large number of evaluations of MFE to find an improved solution, but the definition of MFE itself contains time-consuming computation. In this paper, we introduce techniques to reduce such time-consuming evaluations of MFE, by which the proposed dynamic neighborhood search strategy become applicable to the thermodynamical constraints in practice. In computational experiments, our algorithm succeeded in generating better sequence sets for many constraints than exiting methods.

ホスト出版物のタイトルDNA Computing - 13th International Meeting on DNA Computing, DNA13, Revised Selected Papers
出版ステータス出版済み - 8 27 2008
イベント13th International Meeting on DNA Computing, DNA13 - Memphis, TN, 米国
継続期間: 6 4 20076 8 2007


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4848 LNCS


その他13th International Meeting on DNA Computing, DNA13
CityMemphis, TN

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Dynamic neighborhood searches for thermodynamically designing DNA sequence」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。