Graph-theoretic formalization of hybridization in DNA sticker complexes

DOI10.1007/S11047-013-9361-1MaRDI QIDQ256713zbMATH OpenOpenAlexFDO

Authors Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche

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

graph theorycomplexityDNAhybridization

Mathematics Subject Classification ID

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

Recommendations

• Graph-theoretic formalization of hybridization in DNA sticker complexes
• A comparison of graph-theoretic DNA hybridization models
• Sticker systems with complex structures
• scientific article; zbMATH DE number 1241360
• Sticker DNA computer model. II: Application

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1241360 (Why is no real title available?)
• scientific article; zbMATH DE number 1241374 (Why is no real title available?)
• scientific article; zbMATH DE number 2087023 (Why is no real title available?)
• scientific article; zbMATH DE number 743584 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A comparison of graph-theoretic DNA hybridization models
• A formal model for databases in DNA
• Complexity classes for self-assembling flexible tiles
• Design of a biomolecular device that executes process algebra
• Development of DNA Relational Database and Data Manipulation Experiments
• Efficient Turing-universal computation with DNA polymers
• Graph-theoretic formalization of hybridization in DNA sticker complexes
• On stoichiometry for the assembly of flexible tile DNA complexes
• On the computational power of DNA
• Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
• Parallel biomolecular computation: Models and simulations
• Strand Algebras for DNA Computing
• The computational power of Benenson automata
• Theoretical and experimental DNA computation.
• Transactions on Computational Systems Biology III

Cited in

(4)

• Graph-theoretic formalization of hybridization in DNA sticker complexes
• A comparison of graph-theoretic DNA hybridization models
• DNAQL: a query language for DNA sticker complexes
• Four-regular graphs with rigid vertices associated to DNA recombination

This page was built for publication: Graph-theoretic formalization of hybridization in DNA sticker complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256713)