Design tools for reporter strands and DNA origami scaffold strands
DOI10.1016/j.tcs.2016.10.007zbMath1370.68091OpenAlexW2534855364MaRDI QIDQ529038
Ada Morse, Conor Disher, Joanna A. Ellis-Monaghan, Greta Pangborn, Mary Falcigno, Nadrian C. Seeman, Bharti Singh, Brianna Healy, Sam Blakeley, Melissa C. Westland
Publication date: 18 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.007
DNA self-assemblyaugmenting edgesDNA origamiEulerian circuitsknotted DNAreporter strandscaffolding strandturning costs
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Protein sequences, DNA sequences (92D20) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Khovanov homology is an unknot-detector
- On existence of reporter strands in DNA-based graph structures
- Synthesising topological links
- The computational complexity of knot and link problems
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- On the computational complexity of the Jones and Tutte polynomials
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication: Design tools for reporter strands and DNA origami scaffold strands