Graph-theoretic formalization of hybridization in DNA sticker complexes

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

zbMATH Keywords

complexitygraph theoryDNAhybridization

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items

DNAQL: a query language for DNA sticker complexes

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item