Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes

DOI10.1007/978-3-642-23638-9_7zbMath1347.68099OpenAlexW2133879993MaRDI QIDQ3092332

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

Publication date: 16 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/12223

Mathematics Subject Classification ID

Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20) Data structures (68P05)

Related Items

A comparison of graph-theoretic DNA hybridization models ⋮ Extending DNA-Sticker Arithmetic to Arbitrary Size Using Staples ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes

Cites Work

• DNA computing and molecular programming. 16th international conference, DNA 16, Hong Kong, China, June 14--17, 2010. Revised selected papers
• DNA computing and molecular programming. 15th international conference, DNA 15, Fayetteville, AR, USA, June 8--11, 2009. Revised selected papers
• 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
• 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