Results 1  10
of
25
Universal Molecular Computation in Ciliates
 Evolution as Computation
, 2002
"... How do cells and nature "compute"? They read and "rewrite" DNA all the time, by processes that modify sequences at the DNA or RNA level. In 1994, Adleman's elegant solution to a sevencity Directed Hamiltonian Path problem using DNA [1] launched the new field of DNA computin ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
(Show Context)
How do cells and nature "compute"? They read and "rewrite" DNA all the time, by processes that modify sequences at the DNA or RNA level. In 1994, Adleman's elegant solution to a sevencity Directed Hamiltonian Path problem using DNA [1] launched the new field of DNA computing, which in a few years has grown to international scope. However, unknown to this field, ciliated protozoans of genus Oxytricha and Stylonychia had solved a potentially harder problem using DNA several million years earlier. The solution to this "problem", which occurs during the process of gene unscrambling, represents one of nature's ingenious solutions to the problem of the creation of genes. Here we develop a model for the guided homologous recombinations that take place during gene rearrangement and prove that such a model has the computational power of a Turing machine, the accepted formal model of computation. This indicates that, in principle, these unicellular organisms may have the capacity to perform at ...
Computational Power of Gene Rearrangement
"... In [8] we proposed a model to describe the homologous recombinations that take place during massive gene rearrangements in hypotrichous ciliates. Here we develop the model by introducing the dependency of homologous recombinations on the presence of certain contexts. We then prove that such a model ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
In [8] we proposed a model to describe the homologous recombinations that take place during massive gene rearrangements in hypotrichous ciliates. Here we develop the model by introducing the dependency of homologous recombinations on the presence of certain contexts. We then prove that such a model has the computational power of a Turing machine. This indicates that, in principle, some unicellular organisms may have the capacity to perform any computation carried out by an electronic computer.
On the Power of Circular Splicing Systems and DNA Computability
 Proc. of IEEE Intern. Conf. on Evol. Comput. (ICEC'97
, 1997
"... From a biological motivation of interactions between linear and circular DNA sequences, we propose a new type of splicing models called circular H systems and show that they have the same computational power as Turing machines. It is also shown that there effectively exists a universal circular H sy ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
(Show Context)
From a biological motivation of interactions between linear and circular DNA sequences, we propose a new type of splicing models called circular H systems and show that they have the same computational power as Turing machines. It is also shown that there effectively exists a universal circular H system which can simulate any circular H system with the same terminal alphabet, which strongly suggests a feasible design for a DNA computer based on circular splicing. 1 Introduction Since Adleman's breathtaking paper on molecular (DNA) computing ([1]), there have already been quite a few papers on this challenging topic : [10] shows how to solve NPcomplete problems using DNA, while [3] discusses a design method for simulating a Turing machine by molecular biological techniques and shows how to compute PSPACE, and [4]) gives a methodology for breaking the DES using techniques in genetic engineering. In response to the rapid stream of experimental research on this new computation paradigm...
DNA Computing: Models and Implementations
, 2002
"... As the fabrication of integrated circuits continues to take place on increasingly smaller scales, we grow closer to several fundamental limitations on electronic computers. For many classes of problems, computing devices based on biochemical reactions present an attractive alternative to conventiona ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
As the fabrication of integrated circuits continues to take place on increasingly smaller scales, we grow closer to several fundamental limitations on electronic computers. For many classes of problems, computing devices based on biochemical reactions present an attractive alternative to conventional computing paradigms. We present here a survey of the theory and implementation of biologically and biochemically based computers.
Reversible Molecular Computation in Ciliates
, 1999
"... We prove that a reversible model for the guided homologous recombinations that take place during gene rearrangement in ciliates has the computational power of a Turing machine, the accepted formal model of computation. This indicates that, in principle, these unicellular organisms may have the c ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
We prove that a reversible model for the guided homologous recombinations that take place during gene rearrangement in ciliates has the computational power of a Turing machine, the accepted formal model of computation. This indicates that, in principle, these unicellular organisms may have the capacity to perform any computation carried out by an electronic computer.
Formal Grammars for Intermolecular Structure
 In Proceedings of the International IEEE Symposium on Intelligence inNeural and Biological Systems
, 1995
"... Formal grammars can be used to model general forms of intramolecular structure, such as secondary structure of nucleic acids. A new formalism, called cut grammar, is shown to model intermolecular assemblages such as hybridization products, as well. Formal grammars themselves can be modelled by sets ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Formal grammars can be used to model general forms of intramolecular structure, such as secondary structure of nucleic acids. A new formalism, called cut grammar, is shown to model intermolecular assemblages such as hybridization products, as well. Formal grammars themselves can be modelled by sets of oligonucleotides, and derivations from any contextfree grammar can in theory be simulated by hybridization experiments. 1 Introduction The author has previously suggested that derivations and derivation trees from simple formal grammars can be used to model secondary structure of biological macromolecules [9, 10]. Since that time, D. Haussler and colleagues have put this model to good use by employing machine learning techniques to induce stochastic forms of such grammars from sets of example sequences [2, 8]. Because of the resulting increased interest in grammatical models of structure, we here suggest new structural models that extend to populations of strings, whose members are rel...
From String Rewriting to Logical Metabolic Systems
 GRAMMATICAL MODELS OF MULTIAGENT SYSTEMS, GORDON AND BREACH SCIENCE PUBLISHERS
, 1997
"... ..."
On the Universality of Post and Splicing Systems
 Biocomputing: Proceedings of the 1996 Pacific Symposium pages 288299. World Scientific Publishing Co
, 1996
"... In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our resul ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our result with recent known results about the translation of universal Turing machines into splicing systems. 1 Introduction Since the possibility of molecular computing was shown by Adleman's pioneering work ([1]) which, in a test tube, experimentally solves a small instance of an NPcomplete problem, the theoretical formalization of such a new computing technology has been attracting much attention in computer science ([3][5][6][12][17]). One of the formal frameworks for molecular computations is the Tom Head's splicing system ( or H system ), which gives a theoretical foundation for computing based on DNA recombination. Tom Head's seminal work ([9]) on modeling DNA recombination as a splicing sys...
DNA computing in vitro and in vivo
 In Future generation computer systems, Elsevier Science. In
"... This is a review paper addressing two main aspects of DNA computing research: DNA computing in vitro (in the test tube) and in vivo (in a living organism). We describe the first successful in vitro DNA computing experiment [L.M. Adleman, Science 266 (1994) 1021–1024] which solved a mathematical prob ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This is a review paper addressing two main aspects of DNA computing research: DNA computing in vitro (in the test tube) and in vivo (in a living organism). We describe the first successful in vitro DNA computing experiment [L.M. Adleman, Science 266 (1994) 1021–1024] which solved a mathematical problem, the Directed Hamiltonian Path Problem, solely by manipulation of DNA strands in test tubes. We then address DNA computing in vivo by presenting a model proposed by Head [in: G.