Skip to main content
Log in

Automated analysis of tethered DNA nanostructures using constraint solving

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

Implementing DNA computing circuits using components tethered to a surface offers several advantages over using components that freely diffuse in bulk solution. However, automated computational modeling of tethered circuits is far more challenging than for solution-phase circuits, because molecular geometry must be taken into account when deciding whether two tethered species may interact. Here, we tackle this issue by translating a tethered molecular circuit into a constraint problem that encodes the possible physical configurations of the components, using a simple biophysical model. We use a satisfaction modulo theories solver to determine whether the constraint problem associated with a given structure is satisfiable, which corresponds to whether that structure is physically realizable given the constraints imposed by the tether geometry. We apply this technique to example structures from the literature, and discuss how this approach could be integrated with a reaction enumerator to enable fully automated analysis of tethered molecular computing systems. This paper is a significantly revised and extended version of a conference publication: Lakin and Phillips (in Brijder and Qian (eds) Proceedings of the 23rd International Conference on DNA Computing and Molecular Programming. Lecture Notes in Computer Science, vol 10467, pp 1–16, 2017).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. See the Supporting Information (available from the first author’s web page) for full details of the examples and corresponding constraints.

References

Download references

Acknowledgements

The authors thank Neil Dalchau and Rasmus Petersen for productive discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthew R. Lakin.

Additional information

This material is based upon work supported by the National Science Foundation under Grants 1525553, 1518861, and 1318833.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lakin, M.R., Phillips, A. Automated analysis of tethered DNA nanostructures using constraint solving. Nat Comput 17, 709–722 (2018). https://doi.org/10.1007/s11047-018-9693-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-018-9693-y

Keywords

Navigation