An attractive feature of DNA-based computers is the
large number of possible sequences (4n) of a given
length n with which to represent information. The
problem, however, is that any given sequence is not
necessarily independent of the other sequences, and
thus, reactions among them can interfere with the
reliability and efficiency of the computation.
Independent sequences might be manufactured in the test
tube using evolutionary methods. To this end, an in
vitro selection has been developed that selects
maximally mismatched DNA sequences. In order to
understand the behavior of the protocol, a computer
simulation of the protocol was done, results of which
showed that Watson-Crick pairs of independent
oligonucleotides were preferentially selected. In
addition, to explore the computational capability of
the selection protocol, a design is presented that
generates the Fibonacci sequence of numbers.
%0 Journal Article
%1 nuser:2003:GPEM
%A Nuser, Maryam
%A Deaton, Russell
%D 2003
%J Genetic Programming and Evolvable Machines
%K DNA computing, design, in selection simulation, vitro word
%N 2
%P 173--183
%R doi:10.1023/A:1023937113468
%T Simulations of DNA Computing with In Vitro
Selection
%V 4
%X An attractive feature of DNA-based computers is the
large number of possible sequences (4n) of a given
length n with which to represent information. The
problem, however, is that any given sequence is not
necessarily independent of the other sequences, and
thus, reactions among them can interfere with the
reliability and efficiency of the computation.
Independent sequences might be manufactured in the test
tube using evolutionary methods. To this end, an in
vitro selection has been developed that selects
maximally mismatched DNA sequences. In order to
understand the behavior of the protocol, a computer
simulation of the protocol was done, results of which
showed that Watson-Crick pairs of independent
oligonucleotides were preferentially selected. In
addition, to explore the computational capability of
the selection protocol, a design is presented that
generates the Fibonacci sequence of numbers.
@article{nuser:2003:GPEM,
abstract = {An attractive feature of DNA-based computers is the
large number of possible sequences (4n) of a given
length n with which to represent information. The
problem, however, is that any given sequence is not
necessarily independent of the other sequences, and
thus, reactions among them can interfere with the
reliability and efficiency of the computation.
Independent sequences might be manufactured in the test
tube using evolutionary methods. To this end, an in
vitro selection has been developed that selects
maximally mismatched DNA sequences. In order to
understand the behavior of the protocol, a computer
simulation of the protocol was done, results of which
showed that Watson-Crick pairs of independent
oligonucleotides were preferentially selected. In
addition, to explore the computational capability of
the selection protocol, a design is presented that
generates the Fibonacci sequence of numbers.},
added-at = {2008-06-19T17:35:00.000+0200},
author = {Nuser, Maryam and Deaton, Russell},
biburl = {https://www.bibsonomy.org/bibtex/215b2d5ebd385e7cbdd1d074167736be5/brazovayeye},
doi = {doi:10.1023/A:1023937113468},
interhash = {42cd858b47a2db16298f231ac1abc759},
intrahash = {15b2d5ebd385e7cbdd1d074167736be5},
issn = {1389-2576},
journal = {Genetic Programming and Evolvable Machines},
keywords = {DNA computing, design, in selection simulation, vitro word},
month = {June},
notes = {Special Issue on Biomolecular Machines and Artificial
Evolution Article ID: 5122744},
number = 2,
pages = {173--183},
timestamp = {2008-06-19T17:48:38.000+0200},
title = {Simulations of {DNA} Computing with In Vitro
Selection},
volume = 4,
year = 2003
}