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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, 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
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)
The computational power of Benenson automata
Theoretical Computer Science
Database Systems: The Complete Book
Database Systems: The Complete Book
Complexity classes for self-assembling flexible tiles
Theoretical Computer Science
DNA Computing and Molecular Programming: 15th International Conference, DNA 15, Fayetteville, AR, USA, June 8-11, 2009, Revised Selected Papers
Strand Algebras for DNA Computing
DNA Computing and Molecular Programming
Design of a Biomolecular Device That Executes Process Algebra
DNA Computing and Molecular Programming
Proceedings of the 16th international conference on DNA computing and molecular programming
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Efficient turing-universal computation with DNA polymers
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
On stoichiometry for the assembly of flexible tile DNA complexes
Natural Computing: an international journal
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
Development of DNA relational database and data manipulation experiments
DNA'06 Proceedings of the 12th international conference on DNA Computing
Abstract machines of systems biology
Transactions on Computational Systems Biology III
A comparison of graph-theoretic DNA hybridization models
Theoretical Computer Science
A formal model for databases in DNA
ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology
Hi-index | 0.00 |
Sticker complexes are a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a purely declarative definition of hybridization. We introduce the notion of terminating hybridization, which intuitively means that only a finite number of different products can be generated. We characterize this notion in purely graph-theoretic terms. Under a finite alphabet, each product is shown to be of polynomial size. Yet, terminating hybridization can still produce results of exponential size, in that there may be exponentially many different (nonisomorphic) finished products. We indicate a class of complexes where hybridization is guaranteed to be polynomially bounded.