On design principles for a molecular computer
Communications of the ACM
An algorithm for drawing general undirected graphs
Information Processing Letters
Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Graph drawing by force-directed placement
Software—Practice & Experience
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
The PEPA workbench: a tool to support a process algebra-based approach to performance modelling
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Graph layout for applications in compiler construction
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
Graph drawing and its applications
Drawing graphs
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Topics in the theory of DNA computing
Theoretical Computer Science - Natural computing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
From Molecular Computing to Molecular Programming
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
String Tile Models for DNA Computing by Self-Assembly
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Evolution as a Computational Engine
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
Dna-based string rewrite computational systems
Dna-based string rewrite computational systems
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Theory of cellular automata: a survey
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Formal Molecular Biology Done in CCS-R
Electronic Notes in Theoretical Computer Science (ENTCS)
Autonomous programmable biomolecular devices using self-assembled DNA nanostructures
Communications of the ACM - ACM's plan to go online first
Bio-PEPA: An Extension of the Process Algebra PEPA for Biochemical Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Toward molecular programming with DNA
Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
The many facets of natural computing
Communications of the ACM
On the Computational Power of Biochemistry
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
A proposed modularized DNA computer, based on biochips
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Logical reversibility of computation
IBM Journal of Research and Development
DNA as a Universal Substrate for Chemical Kinetics
DNA Computing
Strand Algebras for DNA Computing
DNA Computing and Molecular Programming
A Domain-Specific Language for Programming in the Tile Assembly Model
DNA Computing and Molecular Programming
Renewable, Time-Responsive DNA Logic Gates for Scalable Digital Circuits
DNA Computing and Molecular Programming
Time-Complexity of Multilayered DNA Strand Displacement Circuits
DNA Computing and Molecular Programming
Turing universality of the biochemical ground form
Mathematical Structures in Computer Science
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Abstract interpretation of cellular signalling networks
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Programming in Biomolecular Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A compound graph layout algorithm for biological pathways
GD'04 Proceedings of the 12th international conference on Graph Drawing
Abstract machines of systems biology
Transactions on Computational Systems Biology III
DNA'04 Proceedings of the 10th international conference on DNA computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Biomolecular computing and programming
IEEE Transactions on Evolutionary Computation
Hi-index | 0.01 |
Computation via biological devices has been the subject of close scrutiny since von Neumann's early work some 60 years ago. In spite of the many relevant works in this field, the notion of programming biological devices seems to be, at best, ill-defined. While many devices are claimed or proved to be computationally universal in some sense, the full step to a bona fide programming language is rarely taken, and one question is noticeable by its absence: If the device is universal, where are the programs? We begin with an extensive review of the literature on programming-related biocomputing; and briefly identify some strengths and shortcomings from a programming perspective. To show concretely what one could see as programming in biocomputing, we outline (from recent work) a computation model and a small programming language that are biologically more plausible than existing silicon-inspired models. Whether or not the model is biologically plausible in an absolute sense, we believe it sets a standard for a biological device that can be both universal and programmable.