We present a general design technique for rendering any 3D wireframe model, that is any connected graph linearly embedded in 3D space, as an RNA origami nanostructure with a minimum number of kissing loops. The design algorithm, which applies some ideas and methods from topological graph theory, produces renderings that contain at most one kissing-loop pair for many interesting model families, including for instance all fully triangulated wireframes and the wireframes of all Platonic solids. The design method is already implemented and available for use in the design tool DNAforge (https://dnaforge.org).
@InProceedings{elonen_et_al:LIPIcs.DNA.30.4, author = {Elonen, Antti and Orponen, Pekka}, title = {{Designing 3D RNA Origami Nanostructures with a Minimum Number of Kissing Loops}}, booktitle = {30th International Conference on DNA Computing and Molecular Programming (DNA 30)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-344-7}, ISSN = {1868-8969}, year = {2024}, volume = {314}, editor = {Seki, Shinnosuke and Stewart, Jaimie Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.30.4}, URN = {urn:nbn:de:0030-drops-209325}, doi = {10.4230/LIPIcs.DNA.30.4}, annote = {Keywords: RNA origami, wireframe nanostructures, polyhedra, kissing loops, topological graph embeddings, self-assembly} }
Feedback for Dagstuhl Publishing