Document Open Access Logo

Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer

Authors Ahmed Shalaby , Chris Thachuk , Damien Woods

PDF
Thumbnail PDF

File

LIPIcs.DNA.29.1.pdf
  • Filesize: 10.38 MB
  • 22 pages

Document Identifiers

Author Details

Ahmed Shalaby
  • Hamilton Institute, Department of Computer Science, Maynooth University, Ireland
Chris Thachuk
  • Paul G. Allen School of Computer Science & Engineering, University of Washington, Seattle, WA, USA
Damien Woods
  • Hamilton Institute, Department of Computer Science, Maynooth University, Ireland

Funding

Damien Woods and Ahmed Shalaby were supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 772766, Active-DNA project), and Science Foundation Ireland (SFI) under grant numbers 20/FFP-P/8843 and 18/ERCS/5746. Chris Thachuk was supported by a US NSF grant (CCF 2211792) and a Faculty Early Career Development Award from NSF (CCF 2143227).

Acknowledgements

We thank Abeer Eshra for extensive discussions on the thermodynamics and kinetics of SDC-based strand displacement and for experimental advice, Tristan Stérin for thoughts on the SDC model, Dave Doty for helpful comments, and Constantine Evans, David Soloveichik and Erik Winfree for insightful algorithmic discussions.

Cite AsGet BibTex

Ahmed Shalaby, Chris Thachuk, and Damien Woods. Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer. In 29th International Conference on DNA Computing and Molecular Programming (DNA 29). Leibniz International Proceedings in Informatics (LIPIcs), Volume 276, pp. 1:1-1:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.DNA.29.1

Abstract

Polynomial time dynamic programming algorithms play a crucial role in the design, analysis and engineering of nucleic acid systems including DNA computers and DNA/RNA nanostructures. However, in complex multistranded or pseudoknotted systems, computing the minimum free energy (MFE), and partition function of nucleic acid systems is NP-hard. Despite this, multistranded and/or pseudoknotted systems represent some of the most utilised and successful systems in the field. This leaves open the tempting possibility that many of the kinds of multistranded and/or pseudoknotted systems we wish to engineer actually fall into restricted classes, that do in fact have polynomial time algorithms, but we've just not found them yet. Here, we give polynomial time algorithms for MFE and partition function calculation for a restricted kind of multistranded system called the 1D scaffolded DNA computer. This model of computation thermodynamically favours correct outputs over erroneous states, simulates finite state machines in 1D and Boolean circuits in 2D, and is amenable to DNA storage applications. In an effort to begin to ask the question of whether we can naturally compare the expressivity of nucleic acid systems based on the computational complexity of prediction of their preferred energetic states, we show our MFE problem is in logspace (the complexity class L), making it perhaps one of the simplest known, natural, nucleic acid MFE problems. Finally, we provide a stochastic kinetic simulator for the 1D scaffolded DNA computer and evaluate strategies for efficiently speeding up this thermodynamically favourable system in a constant-temperature kinetic regime.

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
  • Applied computing → Physical sciences and engineering
Keywords
  • thermodynamic computation
  • model of computation
  • molecular computing
  • minimum free energy
  • partition function
  • DNA computing
  • DNA self-assembly
  • DNA strand displacement
  • kinetics simulation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Supplementary Materials

References

  1. Tatsuya Akutsu. Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Applied Mathematics, 104(1-3):45-62, 2000. Google Scholar
  2. Stefan Badelt, Casey Grun, Karthik V Sarma, Brian Wolfe, Seung Woo Shin, and Erik Winfree. A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures. Journal of the Royal Society Interface, 17(167):20190866, 2020. Google Scholar
  3. Harry M. T. Choi, Maayan Schwarzkopf, Mark E. Fornace, Aneesh Acharya, Georgios Artavanis, Johannes Stegmaier, Alexandre Cunha, and Niles A. Pierce. Third-generation in situ hybridization chain reaction: multiplexed, quantitative, sensitive, versatile, robust. Development, 145(12):dev165753, June 2018. Google Scholar
  4. Anne Condon, Monir Hajiaghayi, and Chris Thachuk. Predicting minimum free energy structures of multi-stranded nucleic acid complexes is APX-hard. In Matthew Lakin and Petr Šulc, editors, 27th International Conference on DNA Computing and Molecular Programming (DNA 27), volume 205 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, 2021. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Google Scholar
  5. Matthew Cook, Tristan Stérin, and Damien Woods. Small tile sets that compute while solving mazes. In Matthew Lakin and Petr Šulc, editors, 27th International Conference on DNA Computing and Molecular Programming (DNA 27), volume 205 of Leibniz International Proceedings in Informatics (LIPIcs), pages 1-20, Dagstuhl, Germany, 2021. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Arxiv preprint: URL: https://arxiv.org/abs/2106.12341.
  6. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT Press, 2022. Google Scholar
  7. Robert M Dirks, Justin S Bois, Joseph M Schaeffer, Erik Winfree, and Niles A Pierce. Thermodynamic analysis of interacting nucleic acid strands. SIAM review, 49(1):65-88, 2007. Google Scholar
  8. David Doty, Trent A Rogers, David Soloveichik, Chris Thachuk, and Damien Woods. Thermodynamic binding networks. In DNA23: The 23rd International Conference on DNA Computing and Molecular Programming, volume 10467 of LNCS, pages 249-266. Springer, 2017. Google Scholar
  9. Constantine G Evans. Rgrow tile self-assembly simulator, May 2023. URL: https://doi.org/10.5281/zenodo.7915489.
  10. Constantine G Evans, Jackson O'Brien, Erik Winfree, and Arvind Murugan. Pattern recognition in the nucleation kinetics of non-equilibrium self-assembly. arXiv preprint arXiv:2207.06399, 2022. Google Scholar
  11. Constantine G Evans and Erik Winfree. Physical principles for DNA tile self-assembly. Chemical Society Reviews, 46(12):3808-3829, 2017. Google Scholar
  12. Cody Geary, Paul WK Rothemund, and Ebbe S Andersen. A single-stranded architecture for cotranscriptional folding of RNA nanostructures. Science, 345(6198):799-804, 2014. Google Scholar
  13. Daniel T Gillespie. Exact stochastic simulation of coupled chemical reactions. The journal of physical chemistry, 81(25):2340-2361, 1977. Google Scholar
  14. Raymond Greenlaw, H James Hoover, and Walter L Ruzzo. Limits to parallel computation: P-completeness theory. Oxford University Press, USA, 1995. Google Scholar
  15. Rune B Lyngsø and Christian NS Pedersen. RNA pseudoknot prediction in energy-based models. Journal of computational biology, 7(3-4):409-427, 2000. Google Scholar
  16. Cristopher Moore and Stephan Mertens. The Nature of Computation. Oxford University Press, 2011. Google Scholar
  17. Ruth Nussinov, George Pieczenik, Jerrold R Griggs, and Daniel J Kleitman. Algorithms for loop matchings. SIAM Journal on Applied mathematics, 35(1):68-82, 1978. Google Scholar
  18. Christos H Papadimitriou. Computational complexity. Addison-Wesley, 1994. Google Scholar
  19. Andrew Phillips and Luca Cardelli. A programming language for composable DNA circuits. Journal of the Royal Society Interface, 6(suppl_4):S419-S436, 2009. Google Scholar
  20. Lulu Qian and Erik Winfree. Scaling up digital circuit computation with DNA strand displacement cascades. science, 332(6034):1196-1201, 2011. Google Scholar
  21. Paul WK Rothemund. Folding DNA to create nanoscale shapes and patterns. Nature, 440(7082):297-302, 2006. Google Scholar
  22. John SantaLucia Jr and Donald Hicks. The thermodynamics of DNA structural motifs. Annu. Rev. Biophys. Biomol. Struct., 33:415-440, 2004. Google Scholar
  23. Joseph Malcolm Schaeffer, Chris Thachuk, and Erik Winfree. Stochastic simulation of the kinetics of multiple interacting nucleic acid strands. In DNA Computing and Molecular Programming: 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings 21, pages 194-211. Springer, 2015. Google Scholar
  24. Tristan Stérin, Abeer Eshra, and Damien Woods. Thermodynamically favoured algorithms on a scaffolded DNA computer. In preparation. (Preliminary version presented at The 28th International Conference on DNA Computing and Molecular Programming (DNA28), Track B, 2022.). Google Scholar
  25. Petr Šulc, Flavio Romano, Thomas E Ouldridge, Lorenzo Rovigatti, Jonathan PK Doye, and Ard A Louis. Sequence-dependent thermodynamics of a coarse-grained DNA model. The Journal of chemical physics, 137(13):135101, 2012. Google Scholar
  26. Boya Wang, Cameron Chalk, and David Soloveichik. SIMD||DNA: Single instruction, multiple data computation with DNA strand displacement cascades. In DNA Computing and Molecular Programming: 25th International Conference, DNA 25, Seattle, WA, USA, August 5-9, 2019, Proceedings 25, pages 219-235. Springer, 2019. Google Scholar
  27. Boya Wang, Siyuan Stella Wang, Cameron Chalk, Andrew Ellington, and David Soloveichik. Parallel molecular computation on digital data stored in DNA. bioRxiv, pages 2022-08, 2022. Google Scholar
  28. Michael S Waterman and Temple F Smith. RNA secondary structure: A complete mathematical analysis. Mathematical Biosciences, 42(3-4):257-266, 1978. Google Scholar
  29. Bryan Wei, Mingjie Dai, and Peng Yin. Complex shapes self-assembled from single-stranded DNA tiles. Nature, 485(7400):623-626, 2012. Google Scholar
  30. Erik Winfree, Rebecca Schulman, and Constantine Evans. The xgrow simulator, 2003. Google Scholar
  31. Damien Woods, David Doty, Cameron Myhrvold, Joy Hui, Felix Zhou, Peng Yin, and Erik Winfree. Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature, 567(7748):366-372, 2019. Google Scholar
  32. Sedigheh Zolaktaf, Frits Dannenberg, Erik Winfree, Alexandre Bouchard-Côté, Mark Schmidt, and Anne Condon. Efficient parameter estimation for DNA kinetics modeled as continuous-time markov chains. In DNA Computing and Molecular Programming: 25th International Conference, DNA 25, Seattle, WA, USA, August 5-9, 2019, Proceedings 25, pages 80-99. Springer, 2019. Google Scholar
  33. Michael Zuker and Patrick Stiegler. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic acids research, 9(1):133-148, 1981. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact