A computational framework for designing micron-scale crisscross DNA megastructures

Crisscross polymerization enables the assembly of hundreds of unique DNA origami 'slats' into micron-sized structures with nanoscale precision. To design these megastructures, thousands of handle sequences from a fixed library must be assigned to individual slats to encode the desired binding architecture. This complexity presents two major challenges: handles must be selected to minimize parasitic interactions that compete with desired assembly, and the fabrication of hundreds of unique slats creates a substantial logistical burden. Here, we develop a unified framework that standardizes the design and fabrication of crisscross megastructures. We use an evolutionary algorithm to optimize handle assignment and minimize parasitic binding between slats. Together with an expanded handle library, the algorithm enables the assembly of large, multi-layered megastructures that otherwise would be produced at negligible yields. We have released this framework as #-CAD, an open-source graphical application that integrates these algorithms, streamlines laboratory workflows, and makes crisscross DNA origami more broadly accessible.

Authors

Institutions

Publication Details

Journal
Nature Communications
Published
2026-07-17
DOI
https://doi.org/10.1038/s41467-026-75175-6
Primary Topic
Advanced biosensing and bioanalysis techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A computational framework for designing micron-scale crisscross DNA megastructures

Florian Katzmeier, Matthew Aquilina, Julie Finkel, William M. Shih et al.
Nature Communications
Advanced biosensing and bioanalysis techniques
article

A computational framework for designing micron-scale crisscross DNA megastructures

Florian Katzmeier, Matthew Aquilina, Julie Finkel, William M. Shih, Su Hyun Seok, Siyuan S. Wang, J H Lee, Seungwoo Lee, Corey Becker, Yichen Zhao, Huangchen Cui, Minke A. D. Nijenhuis
article en

Abstract

Crisscross polymerization enables the assembly of hundreds of unique DNA origami 'slats' into micron-sized structures with nanoscale precision. To design these megastructures, thousands of handle sequences from a fixed library must be assigned to individual slats to encode the desired binding architecture. This complexity presents two major challenges: handles must be selected to minimize parasitic interactions that compete with desired assembly, and the fabrication of hundreds of unique slats creates a substantial logistical burden. Here, we develop a unified framework that standardizes the design and fabrication of crisscross megastructures. We use an evolutionary algorithm to optimize handle assignment and minimize parasitic binding between slats. Together with an expanded handle library, the algorithm enables the assembly of large, multi-layered megastructures that otherwise would be produced at negligible yields. We have released this framework as #-CAD, an open-source graphical application that integrates these algorithms, streamlines laboratory workflows, and makes crisscross DNA origami more broadly accessible.

Nature Communications
University of Stuttgart (DE), Harvard University (US), Korea University (KR), Harvard University Press (US), Max Planck Institute for Solid State Research (DE), Dana-Farber Cancer Institute (US), Dana-Farber/Harvard Cancer Center (US), Korea Institute of Science and Technology (KR)
Alfred P. Sloan Foundation, Office of Science
Openalex Percentile: Top 14%
Advanced biosensing and bioanalysis techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.