this paper describes Grammar-based Immune programming (GIP) for evolving programs in an arbitrary language by immunological inspiration. GIP is based on Grammatical Evolution (GE) in which a grammar is used to define ...
详细信息
this paper describes Grammar-based Immune programming (GIP) for evolving programs in an arbitrary language by immunological inspiration. GIP is based on Grammatical Evolution (GE) in which a grammar is used to define a language and decode candidate solutions to a valid representation (program). However, by default, GE uses a Genetic Algorithm in the search process while GIP uses an artificial immune system. Some modifications are needed of an immune algorithm to use a grammar in order to efficiently decode antibodies into programs. Experiments are performed to analyze algorithm behavior over different aspects and compare it with GEVA, a well known GE implementation. the methods are applied to identify a causal model (an ordinary differential equation) from an observed data set, to symbolically regress an iterated function f(f(x)) = g(x), and to find a symbolic representation of a discontinuous function.
Process algebras are widely used to define the formal semantics of concurrent communicating processes. In this paper, we implement a particularly expressive form of process algebra, known as stochastic pi-calculus;at ...
详细信息
ISBN:
(纸本)9783642106033
Process algebras are widely used to define the formal semantics of concurrent communicating processes. In this paper, we implement a particularly expressive form of process algebra, known as stochastic pi-calculus;at the molecular scale by providing a design for a dna-based biomolecular device that simulates a process algebraic machine. Our design of the molecular stochastic pi-calculus system makes use of a modified form of Whiplash-PCR (WPCR) machines. In this design, we connect (via a tethering dna nanostructure) a number of dna strands, each of which corresponds to a WPCR. machine. this collection of WPCR machines are used to execute distinct concurrent processes, each with its own distinct program. Furthermore, their close proximity enables computation to proceed via communication.
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using dna strand displacement reactions. the potential applications of this and similar technologies in...
详细信息
ISBN:
(纸本)9783642106033
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using dna strand displacement reactions. the potential applications of this and similar technologies inspire the study of the computation time of multilayered molecular circuits. Using mass action kinetics to model dna strand displacement-based circuits, we discuss how computation time scales withthe number of layers. We show that depending on circuit architecture, the time-complexity does not necessarily scale linearly withthe depth as is assumed in the usual study of circuit complexity. We compare circuits with catalytic and non-catalytic components, showing that catalysis fundamentally alters asymptotic time-complexity. Our results rely on simple asymptotic arguments that should be applicable to a wide class of chemical circuits. these results may help to improve circuit performance and may be useful for the construction of faster, larger and more reliable molecular circuitry.
We introduce a domain-specific language (DSL) for creating sets of tile types for simulations of the abstract Tile Assembly Model. the language defines objects known as tile templates, which represent related groups o...
详细信息
ISBN:
(纸本)9783642106033
We introduce a domain-specific language (DSL) for creating sets of tile types for simulations of the abstract Tile Assembly Model. the language defines objects known as tile templates, which represent related groups of tiles, and a small number of basic operations on tile templates that help to eliminate the error-prone drudgery of enumerating such tile types manually or with low-level constructs of general-purpose programming languages. the language is implemented as a class library in Python (a so-called internal DSL), but is presented independently of Python or object-oriented programming, with emphasis on support for a visual editing tool for creating large sets of complex tile types.
In this article, we introduce a design of dna logic gates based on enzymatic restriction of dna strands. We present a construction for a set of one and two-input logic gates and argue that our construction can be gene...
详细信息
ISBN:
(纸本)9783642106033
In this article, we introduce a design of dna logic gates based on enzymatic restriction of dna strands. We present a construction for a set of one and two-input logic gates and argue that our construction can be generalized to implement any Boolean operation. A key feature of our design is its time-responsiveness, in the presence of appropriate fuels these gates can operate continuously and generate a time-dependent output in response to a time-dependant input. they can be interconnected to form digital circuits. Moreover, modulo connectivity information, the strand design and circuit design phases are decoupled.
the area of dna cryptography is an interdisciplinary field that has emerged recently, focusing on the possible applications of dna (deoxyribonucleic acid) molecules for secure encryption and data storage. It uses dna ...
详细信息
A surface chemical reaction network (sCRN, Qian and Winfree in dnacomputing and molecularprogramming: 20thinternationalconference, dna 20, Kyoto, Japan, September 22-26, 2014. Proceedings 20. Springer, 2014) is an...
详细信息
A surface chemical reaction network (sCRN, Qian and Winfree in dnacomputing and molecularprogramming: 20thinternationalconference, dna 20, Kyoto, Japan, September 22-26, 2014. Proceedings 20. Springer, 2014) is an emergent paradigm for molecularprogramming, in which a chemical molecule is placed at each site of a lattice, and each molecule may undergo either bi-molecular reactions associated with one of the nearest molecules or uni-molecular reactions autonomously. the lattice structure as well as the localized reactions between molecules facilitate an effective formalization of sCRNs in the framework of cellular automata. this formalism not only allows a systematic evaluation of the complexity of a sCRN, but also enables a formal approach to reduce the model's complexity for the sake of improving its effectiveness. To this end, this paper proposes a new sCRN model that has less complexity measured in terms of the numbers of both cell states and transition rules. Especially, universality of computations will be shown by implementing all asynchronous circuits, including the well-known full-adder, into the sCRN. the decreased complexity may enhance the feasibility of the proposed sCRN model for physical implementation.
Recently, dna logic gates and dna machines have been developed using only a simple complementary base pairing of dna, that is, hybridization and branch migration. Because such reaction systems have been designed by tr...
详细信息
ISBN:
(纸本)9783642106033
Recently, dna logic gates and dna machines have been developed using only a simple complementary base pairing of dna, that is, hybridization and branch migration. Because such reaction systems have been designed by trial and error, it has been difficult to design a complex system and to correctly verify the reaction. the purpose of this research is to develop a method for automatically searching and designing dna logic gates based on a kinetic simulation. Since the solution space that should be searched is quite large, a simulated-annealing method is used to search for a highly evaluated system from many candidates and find a semi-optimal one. A simulator based on a kinetic model is developed, which calculates the time change of concentrations of abstracted dna molecules. An evaluation function, in which the evaluation value rises when the logic gate works correctly, is also designed. the effectiveness of the proposed method is evaluated experimentally with an AND gate, which is designed automatically.
We have succeeded in construction of the AND gate using enzymatic reactions developed for modularized computation elements of the autonomous computing system RTRACS. Experimental results demonstrated that the molecula...
详细信息
ISBN:
(纸本)9783642106033
We have succeeded in construction of the AND gate using enzymatic reactions developed for modularized computation elements of the autonomous computing system RTRACS. Experimental results demonstrated that the molecular reaction for the AND gate generated the correct output RNA from input RNAs according to the truth table for the AND gate. the constructed molecular reaction for the AND gate can be extended to the NAND gate by small modifications, because not only a logical 1 but also a logical 0 for inputs and output was associated withthe presence of RNA strands.
molecular beacons have the advantages of simple structure, high sensitivity and quick response etc.. dnacomputing is a new method of simulating bio-molecular structure and computing using molecule biology technology,...
详细信息
ISBN:
(纸本)9781424438655
molecular beacons have the advantages of simple structure, high sensitivity and quick response etc.. dnacomputing is a new method of simulating bio-molecular structure and computing using molecule biology technology, and creates a precedent in using bio-chemical reaction as the calculating tools. It is a novel way to solve a class of problems that are difficult to calculate NP-complete problem. In this paper the corresponding dnacomputing of implicit enumeration is given using the advantages of molecular beacons based on previous studies.
暂无评论