Executing parallel logical operations with DNA

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 present...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 1999 Congress on Evolutionary Computation, CEC99 : July 6-9, 1999, Mayflower Hotel, Washington, D.C., USA Vol. 2; pp. 972 - 979 Vol. 2
Main Authors: Ogihara, M., Ray, A.
Format: Conference Proceeding
Language:English
Published: IEEE 1999
Subjects:
Algorithm design and analysis
Biology computing
Computational modeling
Computer science
Concurrent computing
DNA computing
NP-complete problem
Parallel processing
Polymers
Sequences
ISBN:0780355369, 9780780355361
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:0780355369
9780780355361
DOI:10.1109/CEC.1999.782528