An assembling strategy for DNA cages with minimum strands

Abstract DNA polyhedra are artificial cage-like architectures based on interlocked and interlinked DNA double-strands. Using fewer strands to construct DNA cages shows an important role in the design of single-stranded DNA molecules. However, construction methods for DNA polyhedra from topological perspective remains not well understood. In this study, we theoretically propose an assembling procedure for DNA polyhedra with minimum strands based on computer algorithm. The results show that this efficient method could search DNA polyhedra with fewer strands faster. Our research provides new insights into design and synthesis for DNA polyhedra with required topological structures.