Results 1 
4 of
4
Evolutionary Computation as a Paradigm for DNABased Computing
"... . Evolutionary Computation focuses on probabilistic search and optimization methods gleaned from the model of organic evolution. Genetic algorithms, evolution strategies and evolutionary programming are three independently developed representatives of this class of algorithms, with genetic programmi ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. Evolutionary Computation focuses on probabilistic search and optimization methods gleaned from the model of organic evolution. Genetic algorithms, evolution strategies and evolutionary programming are three independently developed representatives of this class of algorithms, with genetic programming and classifier systems as additional paradigms in the field. This paper focuses on the link between evolutionary computation and DNAbased computing by discussing the relevant aspects of evolutionary computation both from a practical and a theoretical point of view. In particular, theoretical results concerning the calculation of convergence velocities and the derivation of optimal schedules for mutation rates respectively steps sizes are presented. The potential for crossfertilization between the fields of DNAbased computing and evolutionary computation is outlined both from a principal point of view and by means of an experimental investigation concerning the NPhard maximum clique pr...
Hamiltonian Paths and Double Stranded DNA
, 1998
"... It is suggested that computations using DNA molecules as computing units may sometimes be simpler to carry out and less error prone if double stranded DNA molecules are used rather than the single stranded molecules currently being used. A detailed illustration is given of a biomolecular algorithm ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is suggested that computations using DNA molecules as computing units may sometimes be simpler to carry out and less error prone if double stranded DNA molecules are used rather than the single stranded molecules currently being used. A detailed illustration is given of a biomolecular algorithm that uses double stranded DNA for the solution of the directed Hamiltonian path problem. 1 Introduction Following the method used by Adleman [1] in his DNA solution of a seven vertex instance of the directed Hamiltonian path (DHP) problem, researchers continue to use the annealing of single stranded DNA in their molecular computing efforts. Single stranded DNA molecules (ssDNAs) are capable of behaviors that obstruct the desired annealings. Through partial self annealing they may form undesired hairpin structures. Undesired partial annealings between distinct ssDNAs may result in undesired ligations. Single stranded DNA molecules are undesirably flexible. Researchers devote substantial e...
On the Power of Insertion P Systems of Small Size
"... Summary. In this article we investigate insertion systems of small size in the framework of P systems. We consider P systems with insertion rules having one symbol context and we show that they have the computational power of matrix grammars. If contexts of length two are permitted, then any recursi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary. In this article we investigate insertion systems of small size in the framework of P systems. We consider P systems with insertion rules having one symbol context and we show that they have the computational power of matrix grammars. If contexts of length two are permitted, then any recursively enumerable language can be generated. In both cases an inverse morphism and a weak coding were applied to the output of the corresponding P systems. 1
Using DNA to solve the Bounded Post Correspondence Problem
"... Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NPcomplete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used to test ..."
Abstract
 Add to MetaCart
Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NPcomplete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used to test several standard molecular biology laboratory procedures