On the computational power of DNA
Discrete Applied Mathematics - Special volume on computational molecular biology
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database Management Systems
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Theoretical Computer Science - Algorithms,automata, complexity and games
A DNA-based memory with in vitro learning and associative recall
Natural Computing: an international journal
Theoretical and Experimental DNA Computation (Natural Computing Series)
Theoretical and Experimental DNA Computation (Natural Computing Series)
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Strand Algebras for DNA Computing
DNA Computing and Molecular Programming
Design of a Biomolecular Device That Executes Process Algebra
DNA Computing and Molecular Programming
Designing nucleotide sequences for computation: a survey of constraints
DNA'05 Proceedings of the 11th international conference on DNA Computing
Development of DNA relational database and data manipulation experiments
DNA'06 Proceedings of the 12th international conference on DNA Computing
Graph-theoretic formalization of hybridization in DNA sticker complexes
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
A comparison of graph-theoretic DNA hybridization models
Theoretical Computer Science
Proceedings of the 16th International Conference on Database Theory
Graph-theoretic formalization of hybridization in DNA sticker complexes
Natural Computing: an international journal
| Hi-index | 0.00 |
Our goal is to better understand, at a theoretical level, the database aspects of DNA computing. Thereto, we introduce a formally defined data model of so-called sticker DNA complexes , suitable for the representation and manipulation of structured data in DNA. We also define DNAQL, a restricted programming language over sticker DNA complexes. DNAQL stands to general DNA computing as the standard relational algebra for relational databases stands to general-purpose conventional computing. The number of operations performed during the execution of a DNAQL program, on any input, is only polynomial in the dimension of the data, i.e., the number of bits needed to represent a single data entry. Moreover, each operation can be implemented in DNA using a constant number of laboratory steps. We prove that the relational algebra can be simulated in DNAQL.