DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adding for-loops to first-order logic
Information and Computation
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
Union Types for Semistructured Data
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Enhancing Semistructured Data Mediators with Document Type Definitions
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
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
The many facets of natural computing
Communications of the ACM
Natural Computing: DNA, Quantum Bits, and the Future of Smart Machines
Natural Computing: DNA, Quantum Bits, and the Future of Smart Machines
Handbook of Natural Computing
Probabilistic Databases
Graph-theoretic formalization of hybridization in DNA sticker complexes
DNA'11 Proceedings of the 17th international conference on 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
A formal model for databases in DNA
ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology
Theory of algorithmic self-assembly
Communications of the ACM
| Hi-index | 0.00 |
This paper presents an exposition of the authors' past and present work on the query language DNAQL for querying databases in DNA. In DNA computing, data is represented and stored in DNA molecules. Accordingly, a logical data model is defined that models complexes of DNA molecules in a graph-oriented fashion. Next, a set of formal operations on DNA complexes is defined, much in the spirit of the operations of the relational algebra in the relational data model. These operations model laboratory operations on DNA in solution. Their combination leads to the query language DNAQL; but in order for programs to be well-defined on prescribed types of inputs, a type system is superimposed on the language. Finally a correspondence is shown between well-typed DNAQL programs and programs in a relational-algebra query language.