Writing by methylation proposed for aqueous computing
Where mathematics, computer science, linguistics and biology meet
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Biomolecular realizations of a parallel architecture for solving combinatorial problems
New Generation Computing
Computing with Bio-Molecules: Theory and Experiments
Computing with Bio-Molecules: Theory and Experiments
Unconventional Models of Computation
Unconventional Models of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Splicing Systems, Aqueous Computing, and Beyond
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
| Hi-index | 0.00 |
Given a subset R of a set A 脳 B, one may ask whether R contains a subset F which is a bijective function from A onto B. A wet lab algorithm for answering this question is presented. Moreover, when such a bijection is contained in R, the algorithm produces a test tube containing a set of DNA plasmids, each of which encodes such a bijection. The number of steps required by the given procedure grows linearly with the number of ordered pairs in the relation R. All known algorithms for solving this bijection problem on conventional computers require a number of steps that grows exponentially in the number of pairs. Various forms of the Hamiltonian path problem are subsumed by the problem of finding such bijections. The algorithm presented is illustrated by outlining its application to the binary relation determined by the directed graph that occurs in the instance of the directed Hamiltonian path problem with which L. Adleman initiated DNA computing.