DNA computing by blocking

Authors:
G. Rozenberg;H. Spaink
Affiliations:
Leiden Institute of Advanced Computer Science (LIACS) and Leiden Center for Natural Computing (LCNC), Leiden University, Netherlands and Department of Computer Science, University of Colorado at B ...;Clusius Laboratory, Institute of Molecular Plant Sciences (IMP) and Leiden Center for Natural Computing (LCNC), Leiden University, Wassenaarseweg 64, 2333 AL Leiden, Netherlands
Venue:
Theoretical Computer Science - Algorithms,automata, complexity and games
Year:
2003

Citing 3
Cited 7

Molecular computation of solutions to combinatorial problems

Science
Elements of the Theory of Computation

Elements of the Theory of Computation
Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing

An alternative definition of splicing

Theoretical Computer Science
Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem

ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Algorithmic applications of XPCR

Natural Computing: an international journal
Towards evolutionary DNA computing

IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
DNA extraction by XPCR

DNA'04 Proceedings of the 10th international conference on DNA computing
Application of mismatch detection methods in DNA computing

DNA'04 Proceedings of the 10th international conference on DNA computing
A formal model for databases in DNA

ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for molecular computing which relies on blocking (inactivating) this part of the total library of molecules that does not contribute to (finding) a solution--this happens essentially in one biostep (after the input has been read). The method is explained by presenting a DNA based algorithm for solving (albeit in the theoretical sense only!) the satisfiability problem.