2014
DOI: 10.1007/s11047-014-9457-2
|View full text |Cite
|
Sign up to set email alerts
|

DNA origami and the complexity of Eulerian circuits with turning costs

Abstract: Building a structure using self-assembly of DNA molecules by origami folding requires finding a route for the scaffolding strand through the desired structure. When the target structure is a 1-complex (or the geometric realization of a graph), an optimal route corresponds to an Eulerian circuit through the graph with minimum turning cost. By showing that it leads to a solution to the 3-SAT problem, we prove that the general problem of finding an optimal route for a scaffolding strand for such structures is NP-… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 31 publications
0
13
0
Order By: Relevance
“…This approach is equivalent to finding an Eulerian circuit in a graph whose nodes and edges are the vertices and edges of the target geometry. Moreover, this problem is NP-hard [18] and both tools handle this complexity differently. vHelix might introduce duplicated edges to ensure a solution to the problem and runs an efficient systematic search to find an optimal routing.…”
Section: Dna Assembly Conceptsmentioning
confidence: 99%
“…This approach is equivalent to finding an Eulerian circuit in a graph whose nodes and edges are the vertices and edges of the target geometry. Moreover, this problem is NP-hard [18] and both tools handle this complexity differently. vHelix might introduce duplicated edges to ensure a solution to the problem and runs an efficient systematic search to find an optimal routing.…”
Section: Dna Assembly Conceptsmentioning
confidence: 99%
“…Since then, and especially since introduction of the origami technique 2 , DNA nanotechnology has seen astonishing developments and increasingly more complex structures are being produced [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18] . But even though general approaches for creating DNA origami polygonal meshes and design software are available 14,16,17,[19][20][21] , constraints arising from DNA geometry and sense/antisense pairing still impose important restrictions and necessitate a fair amount of manual adjustment during the design process. Here we present a general method for folding arbitrary polygonal digital meshes in DNA that readily produces structures that would have been very difficult to realize with previous approaches.…”
mentioning
confidence: 99%
“…The employed mesh routing is connected to graph theory and a Eulerian circuit pathing problem, where the goal is to systematically find an optimal path through the used network by only crossing each edge of the mesh once. This kind of routing can become very complex (NP-hard) depending on the used mesh size and pathing method, and it usually requires an automated algorithm to do it [59]. Different types of methods have been developed to approach this problem and these are discussed in their dedicated sections: gridiron and simple meshes (3.1.…”
Section: Wireframe Design Principlesmentioning
confidence: 99%