Graph-theoretic formalization of hybridization in DNA sticker complexes
From MaRDI portal
Publication:256713
DOI10.1007/s11047-013-9361-1zbMath1332.68030OpenAlexW2168947239MaRDI QIDQ256713
Robert Brijder, Jan Van den Bussche, Joris J. M. Gillis
Publication date: 10 March 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/12223
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of graph-theoretic DNA hybridization models
- Complexity classes for self-assembling flexible tiles
- Parallel biomolecular computation: Models and simulations
- On stoichiometry for the assembly of flexible tile DNA complexes
- Theoretical and experimental DNA computation.
- The computational power of Benenson automata
- A Formal Model for Databases in DNA
- Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems
- Efficient Turing-Universal Computation with DNA Polymers
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
- Strand Algebras for DNA Computing
- Design of a Biomolecular Device That Executes Process Algebra
- Development of DNA Relational Database and Data Manipulation Experiments
- Transactions on Computational Systems Biology III
- On the computational power of DNA
This page was built for publication: Graph-theoretic formalization of hybridization in DNA sticker complexes
