Biomolecular Computing and Programming (Extended Abstract)

Authors:
Max Garzon;Russell Deaton
Affiliations:
-;-
Venue:
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Year:
1999

Citing 9
Cited 0

On design principles for a molecular computer

Communications of the ACM
Molecular computation of solutions to combinatorial problems

Science
DNA computing: a review

Fundamenta Informaticae
Error-resilient DNA computation

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computing with Bio-Molecules: Theory and Experiments

Computing with Bio-Molecules: Theory and Experiments
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
In Vitro Implementation of Finite-State Machines

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
The Complexity and Viability of DNA Computations

Biocomputing and emergent computation: Proceedings of BCEC97
Biomolecular computing and programming

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Molecular computing is a discipline that aims at harnessing individual molecules at nanoscales to perform computations. The best studied molecules for this purpose to date have been DNA and bacteriorhodopsin. Biomolecular computing allows one to realistically entertain, for the first time in history, the possibility of exploiting the massive parallelism at nanoscales for computational power. This talk will discuss major achievements to date, both experimental and theoretical, as well as challenges and major potential advances in the immediate future.