TY - GEN
T1 - The minimum-model DNA computation on a sequence of probe arrays
AU - Ogihara, Mitsunori
AU - Ray, Animesh
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84958770438&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958770438&partnerID=8YFLogxK
U2 - 10.1007/3-540-45833-6_4
DO - 10.1007/3-540-45833-6_4
M3 - Conference contribution
AN - SCOPUS:84958770438
SN - 3540443118
VL - 2509
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 38
EP - 49
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer Verlag
T2 - 3rd International Conference on Unconventional Models of Computation, UMC 2002
Y2 - 15 October 2002 through 19 October 2002
ER -