DNA origami and the complexity of Eulerian circuits with turning costs
From MaRDI portal
Publication:2003481
DOI10.1007/s11047-014-9457-2zbMath1415.68081arXiv1309.4662OpenAlexW2043780835MaRDI QIDQ2003481
Iain Moffatt, Greta Pangborn, Andrew McDowell, Joanna A. Ellis-Monaghan
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.4662
computational complexityHamiltonian cycleDNA self-assemblyDNA origamiEulerian circuitbiomolecular computingA-trailsmill routingthreading strandturning cost
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Design methods for 3D wireframe DNA nanostructures ⋮ Edge-outer graph embedding and the complexity of the DNA reporter strand problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
- On existence of reporter strands in DNA-based graph structures
- On non-intersecting Eulerian circuits
- Eulerian graphs and related topics. Part 1, Volume 1
- Eulerian graphs and related topics. Part 1, Volume 2
- Plane graphs with Eulerian Petrie walks
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
- Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
- Worst-case analysis of a new heuristic for the travelling salesman problem
- A Dynamic Programming Approach to Sequencing Problems
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Graphs on Surfaces
- Optimal Covering Tours with Turn Costs
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: DNA origami and the complexity of Eulerian circuits with turning costs
