Executing parallel logical operations with DNA

Mitsunori Ogihara, Animesh Ray

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

7 Citations (Scopus)

Abstract

DNA computation investigates the potential of DNA as a massively parallel computing device. Research is focused on designing parallel computation models executable by DNA based chemical processes and on developing algorithms in the models. L. Adleman (1994) initiated this area of research by presenting a DNA based method for solving the Hamilton Path Problem. That contribution raised the hope that parallel computation by DNA could be used to tackle NP-complete problems which are thought of as intractable. The current realization however, is that NP-complete problems may not be best suited for DNA based (more generally, molecule based) computing. A better subject for DNA computing could be large scale evaluation of parallel computation models. Several proposals have been made in this direction. We overview those methods, discuss technical and theoretical issues involved, and present some possible applications of those methods.

Original languageEnglish (US)
Title of host publicationProceedings of the 1999 Congress on Evolutionary Computation, CEC 1999
PublisherIEEE Computer Society
Pages972-979
Number of pages8
Volume2
DOIs
StatePublished - 1999
Externally publishedYes
Event1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States
Duration: Jul 6 1999Jul 9 1999

Other

Other1999 Congress on Evolutionary Computation, CEC 1999
CountryUnited States
CityWashington, DC
Period7/6/997/9/99

Fingerprint

Parallel Computation
DNA
NP-complete problem
Hamilton Path
DNA Computing
Chemical Processes
Parallel Computing
Molecules
Computational complexity
Model
Computing
Evaluation
Parallel processing systems

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Ogihara, M., & Ray, A. (1999). Executing parallel logical operations with DNA. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999 (Vol. 2, pp. 972-979). [782528] IEEE Computer Society. https://doi.org/10.1109/CEC.1999.782528

Executing parallel logical operations with DNA. / Ogihara, Mitsunori; Ray, Animesh.

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 2 IEEE Computer Society, 1999. p. 972-979 782528.

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

Ogihara, M & Ray, A 1999, Executing parallel logical operations with DNA. in Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. vol. 2, 782528, IEEE Computer Society, pp. 972-979, 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, United States, 7/6/99. https://doi.org/10.1109/CEC.1999.782528
Ogihara M, Ray A. Executing parallel logical operations with DNA. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 2. IEEE Computer Society. 1999. p. 972-979. 782528 https://doi.org/10.1109/CEC.1999.782528
Ogihara, Mitsunori ; Ray, Animesh. / Executing parallel logical operations with DNA. Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 2 IEEE Computer Society, 1999. pp. 972-979
@inproceedings{458636c8ae91468395753b931744e43d,
title = "Executing parallel logical operations with DNA",
abstract = "DNA computation investigates the potential of DNA as a massively parallel computing device. Research is focused on designing parallel computation models executable by DNA based chemical processes and on developing algorithms in the models. L. Adleman (1994) initiated this area of research by presenting a DNA based method for solving the Hamilton Path Problem. That contribution raised the hope that parallel computation by DNA could be used to tackle NP-complete problems which are thought of as intractable. The current realization however, is that NP-complete problems may not be best suited for DNA based (more generally, molecule based) computing. A better subject for DNA computing could be large scale evaluation of parallel computation models. Several proposals have been made in this direction. We overview those methods, discuss technical and theoretical issues involved, and present some possible applications of those methods.",
author = "Mitsunori Ogihara and Animesh Ray",
year = "1999",
doi = "10.1109/CEC.1999.782528",
language = "English (US)",
volume = "2",
pages = "972--979",
booktitle = "Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Executing parallel logical operations with DNA

AU - Ogihara, Mitsunori

AU - Ray, Animesh

PY - 1999

Y1 - 1999

N2 - DNA computation investigates the potential of DNA as a massively parallel computing device. Research is focused on designing parallel computation models executable by DNA based chemical processes and on developing algorithms in the models. L. Adleman (1994) initiated this area of research by presenting a DNA based method for solving the Hamilton Path Problem. That contribution raised the hope that parallel computation by DNA could be used to tackle NP-complete problems which are thought of as intractable. The current realization however, is that NP-complete problems may not be best suited for DNA based (more generally, molecule based) computing. A better subject for DNA computing could be large scale evaluation of parallel computation models. Several proposals have been made in this direction. We overview those methods, discuss technical and theoretical issues involved, and present some possible applications of those methods.

AB - DNA computation investigates the potential of DNA as a massively parallel computing device. Research is focused on designing parallel computation models executable by DNA based chemical processes and on developing algorithms in the models. L. Adleman (1994) initiated this area of research by presenting a DNA based method for solving the Hamilton Path Problem. That contribution raised the hope that parallel computation by DNA could be used to tackle NP-complete problems which are thought of as intractable. The current realization however, is that NP-complete problems may not be best suited for DNA based (more generally, molecule based) computing. A better subject for DNA computing could be large scale evaluation of parallel computation models. Several proposals have been made in this direction. We overview those methods, discuss technical and theoretical issues involved, and present some possible applications of those methods.

UR - http://www.scopus.com/inward/record.url?scp=84901428237&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901428237&partnerID=8YFLogxK

U2 - 10.1109/CEC.1999.782528

DO - 10.1109/CEC.1999.782528

M3 - Conference contribution

VL - 2

SP - 972

EP - 979

BT - Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

PB - IEEE Computer Society

ER -