DNA-based computation times

Yuliy Baryshnikov, Ed Coffman, Petar Momčilović

Research output: Contribution to journalConference article

11 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)14-23
Number of pages10
JournalLecture Notes in Computer Science
Volume3384
Publication statusPublished - Sep 9 2005
Externally publishedYes
Event10th International Workshop on DNA Computing, DNA 10 - Milan, Italy
Duration: Jun 7 2004Jun 10 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'DNA-based computation times'. Together they form a unique fingerprint.

  • Cite this

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