DNA-based computation times

Yuliy Baryshnikov, Ed Coffman, Petar Momčilović

研究成果: ジャーナルへの寄稿Conference article

11 引用 (Scopus)

抜粋

Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such devices approaches physical limits, new computing paradigms are emerging. Two paradigms receiving great attention are quantum and DNA-based molecular computing. This paper focuses on DNA-based computing. This paradigm can be abstracted to growth models where computational elements called tiles are self-assembled one by one, subject to some simple hierarchical rules, to fill a given template encoding a Boolean formula. While DNA-based computational devices are known to be extremely energy efficient, little is known concerning the fundamental question of computation times. In particular, given a function, we study the time required to determine its value for a given input. In the simplest instance, the analysis has interesting connections with interacting particle systems and variational problems.

元の言語英語
ページ(範囲)14-23
ページ数10
ジャーナルLecture Notes in Computer Science
3384
出版物ステータス出版済み - 9 9 2005
外部発表Yes
イベント10th International Workshop on DNA Computing, DNA 10 - Milan, イタリア
継続期間: 6 7 20046 10 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント DNA-based computation times' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Baryshnikov, Y., Coffman, E., & Momčilović, P. (2005). DNA-based computation times. Lecture Notes in Computer Science, 3384, 14-23.