The minimum-model DNA computation on a sequence of probe arrays

Mitsunori Ogihara, Animesh Ray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper investigates the computational power of a variant of the minimum DNA computation model proposed by Ogihara and Ray. In the variant, two fundamental operations (separation by length and digestion) are dispensed with. To compensate for the loss, the probe arrays are considered as the media for reaction and a wash operation is added to the set of permissible operations. Computation in this model necessarily consists of cycles of five steps: merge, anneal, wash, denature, and wash. It is shown that boolean circuits can be theoretically simulated repetition of the cycle on the same set of four probe arrays.

Original languageEnglish (US)
Title of host publicationUnconventional Models of Computation - Third International Conference, UMC 2002 Kobe, Japan, October 15-19, 2002 Proceedings
EditorsCristian S. Calude, Michael J. Dinneen, Ferdinand Peper
PublisherSpringer Verlag
Pages38-49
Number of pages12
ISBN (Print)3540443118
DOIs
StatePublished - 2002
Externally publishedYes
Event3rd International Conference on Unconventional Models of Computation, UMC 2002 - Kobe, Japan
Duration: Oct 15 2002Oct 19 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2509
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Unconventional Models of Computation, UMC 2002
Country/TerritoryJapan
CityKobe
Period10/15/0210/19/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The minimum-model DNA computation on a sequence of probe arrays'. Together they form a unique fingerprint.

Cite this