Creative Commons Attribution 4.0 International license
Localized molecular circuits offer practical advantages over those implemented using components freely diffusing in bulk solution, such as computation speed and component reuse. A common framework for implementing such circuits uses DNA strand displacement reactions with components localized via tethering to a DNA origami tile. While a number of papers have demonstrated the capability of such circuits, design tools for enumerating localized reactions and analyzing their behavior are relatively scarce. The key difficulty in modeling such circuits is that the geometric constraints imposed by the tethering of specific components at specific points on the tile surface are critical in determining whether or not a particular reaction may occur. In previous work, we deployed simple techniques based on random sampling of the structure space in an attempt to find geometric structures for candidate reaction products that satisfy all of the geometric constraints. In this paper, we show that this approach can be enhanced by using an optimization algorithm that takes initial guessed structures that fail to satisfy certain constraints and attempts to refine them into structures that do satisfy all of the constraints. We illustrate this approach on simple example reactions as well as a strand displacement-based signal transmission example from the literature. This work thus advances the state of the art in modeling tools for localized molecular circuits.
@InProceedings{lakin:LIPIcs.DNA.32.5,
author = {Lakin, Matthew R.},
title = {{Geometric Constraint Optimization for Localized Strand Displacement Reactions}},
booktitle = {32nd International Conference on DNA Computing and Molecular Programming (DNA 32)},
pages = {5:1--5:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-444-4},
ISSN = {1868-8969},
year = {2026},
volume = {387},
editor = {Scalise, Dominic and Schweller, Robert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.32.5},
URN = {urn:nbn:de:0030-drops-267756},
doi = {10.4230/LIPIcs.DNA.32.5},
annote = {Keywords: Localized circuits, reaction enumeration, DNA strand displacement, constraint solving, geometry, molecular computing}
}
archived version
archived version