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

Mitsunori Ogihara; Animesh Ray

doi:10.1007/3-540-45833-6_4

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	38-49
Number of pages	12
Volume	2509
ISBN (Print)	3540443118
DOIs	https://doi.org/10.1007/3-540-45833-6_4
State	Published - 2002
Externally published	Yes
Event	3rd International Conference on Unconventional Models of Computation, UMC 2002 - Kobe, Japan Duration: Oct 15 2002 → Oct 19 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2509
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	3rd International Conference on Unconventional Models of Computation, UMC 2002
Country	Japan
City	Kobe
Period	10/15/02 → 10/19/02

ASJC Scopus subject areas

Computer Science(all)
Theoretical Computer Science

Access to Document

10.1007/3-540-45833-6_4

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

Ogihara, M., & Ray, A. (2002). The minimum-model DNA computation on a sequence of probe arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2509, pp. 38-49). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2509). Springer Verlag. https://doi.org/10.1007/3-540-45833-6_4

The minimum-model DNA computation on a sequence of probe arrays. / Ogihara, Mitsunori; Ray, Animesh.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2509 Springer Verlag, 2002. p. 38-49 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2509).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ogihara, M & Ray, A 2002, The minimum-model DNA computation on a sequence of probe arrays. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2509, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2509, Springer Verlag, pp. 38-49, 3rd International Conference on Unconventional Models of Computation, UMC 2002, Kobe, Japan, 10/15/02. https://doi.org/10.1007/3-540-45833-6_4

Ogihara M, Ray A. The minimum-model DNA computation on a sequence of probe arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2509. Springer Verlag. 2002. p. 38-49. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45833-6_4

Ogihara, Mitsunori ; Ray, Animesh. / The minimum-model DNA computation on a sequence of probe arrays. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2509 Springer Verlag, 2002. pp. 38-49 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6b97770b76624e98b93d4795662ca08c,

title = "The minimum-model DNA computation on a sequence of probe arrays",

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.",

author = "Mitsunori Ogihara and Animesh Ray",

year = "2002",

doi = "10.1007/3-540-45833-6_4",

language = "English (US)",

isbn = "3540443118",

volume = "2509",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "38--49",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "3rd International Conference on Unconventional Models of Computation, UMC 2002 ; Conference date: 15-10-2002 Through 19-10-2002",

}

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 -