DNA sequence design by dynamic neighborhood searches

Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

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

17 被引用数 (Scopus)

抄録

We propose a local-search based algorithm to design DNA sequence sets that satisfy several combinatorial constraints about hamming-distance criteria. To deal with the constraints in the local search, we adopt elaborate (and dynamic) neighborhood search frameworks called the Variable Neighborhood Search (VNS) and the Variable Depth Search (VDS). Although our algorithm can deal with many types of hamming distance-based constraints and is easy to extend (e.g., also applicable for other constraints), in computational experiments, we succeeded in generating better sequence sets than the ones generated by exiting methods of more specified constraints.

本文言語英語
ホスト出版物のタイトルDNA Computing - 12th International Meeting on DNA Computing, DNA12, Revised Selected Papers
ページ157-171
ページ数15
4287 LNCS
DOI
出版ステータス出版済み - 12 1 2006
イベント12th International Meeting on DNA Computing, DNA12 - Seoul, 大韓民国
継続期間: 6 5 20066 9 2006

出版物シリーズ

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

その他

その他12th International Meeting on DNA Computing, DNA12
国/地域大韓民国
CitySeoul
Period6/5/066/9/06

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル