Title of article
Computing with DNA by operating on plasmids
Author/Authors
Head، T. نويسنده , , Rozenberg، G. نويسنده , , Bladergroen، R.S. نويسنده , , Breek، C.K.D. نويسنده , , Lommerse، P.H.M. نويسنده , , Spaink، H.P. نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
-86
From page
87
To page
0
Abstract
A new method of computing using DNA plasmids is introduced and the potential advantages are listed. The new method is illustrated by reporting a laboratory computation of an instance of the NP-complete algorithmic problem of computing the cardinal number of a maximal independent subset of the vertex set of a graph. A circular DNA plasmid, specifically designed for this method of molecular computing, was constructed. This computational plasmid contains a specially inserted series of DNA sequence segments, each of which is bordered by a characteristic pair of restriction enzyme sites. For the computation reported here, the DNA sequence segments of this series were used to represent the vertices of the graph being investigated. By applying a scheme of enzymatic treatments to the computational plasmids, modified plasmids were generated from which the solution of the computational problem was selected. This new method of computing is applicable to a wide variety of algorithmic problems. Further computations in this style are in progress.
Keywords
complexity , Local variance bound , Satisfiability , Bipartite networks , Bayesian belief networks
Journal title
BioSystems
Serial Year
2000
Journal title
BioSystems
Record number
47656
Link To Document