Topics in the theory of DNA computing

Authors:
Martyn Amos;Gheorghe Paun;Grzegorz Rozenberg;Arto Salomaa
Affiliations:
Department of Computer Science, School of Biological Sciences, University of Liverpool, L69 7ZF, England, UK;Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700 Bucuresti, Romania and Rovira i Virgili University, Pl. Imperial Tarraco 1, 43005 Tarragona, Spain;Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, CAA 2333 Leiden, The Netherlands and Department of Computer Science, University of Colorado at Boulder, Boulder, ...;Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520 Turku, Finland
Venue:
Theoretical Computer Science - Natural computing
Year:
2002

Citing 27
Cited 2

Principles of CMOS VLSI design: a systems perspective

Principles of CMOS VLSI design: a systems perspective
Formal languages

Formal languages
The complexity of Boolean functions

The complexity of Boolean functions
The complexity of Boolean networks

The complexity of Boolean networks
Public-key cryptography

Public-key cryptography
Splicing semigroups of dominoes and DNA

Discrete Mathematics
Molecular computation of solutions to combinatorial problems

Science
Regularity of splicing languages

Discrete Applied Mathematics
Computing by splicing

Theoretical Computer Science - Special issue on universal machines and computations
Regular extended H systems are computationally universal

Journal of Automata, Languages and Combinatorics
Cooperating distributed splicing systems

Journal of Automata, Languages and Combinatorics
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Journal of the ACM (JACM)
Nine test tubes generate any RE language

Theoretical Computer Science - Special issue on universal machines and computations
DNA computing based on splicing: universality results

Theoretical Computer Science - Special issue on universal machines and computations
Splicing in abstract families of languages

Theoretical Computer Science
Computing with membranes

Journal of Computer and System Sciences
Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages

Where mathematics, computer science, linguistics and biology meet
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Introduction to VLSI Systems

Introduction to VLSI Systems
A guide to membrane computing

Theoretical Computer Science - Natural computing
A Reduced Distributed Splicing System for RE Languages

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
DNA Computing: Distributed Splicing Systems

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
The Complexity and Viability of DNA Computations

Biocomputing and emergent computation: Proceedings of BCEC97
Forbidding-enforcing systems

Theoretical Computer Science - Algorithms,automata, complexity and games
Simulating Boolean Circuits on a DNA Computer

Simulating Boolean Circuits on a DNA Computer

Computational biology: a programming perspective

Formal modeling
Application of DNA computing in graph theory

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications of DNA computing. In this paper, we demonstrate the theoretical developments by discussing a number of selected topics. We also give an introduction to the basic structure of DNA and the basic DNA processing tools.