Boya Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Boya Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- David Soloveichik
Electrical and Computer Engineering, University of Texas at Austin, Austin, TX 78712, USA
6 shared publications Cameron Chalk
Electrical and Computer Engineering, University of Texas at Austin, Austin, TX 78712, USA
3 shared publicationsChris Thachuk
Paul G. Allen School of Computer Science and Engineering, University of Washington, Seattle, Washington 98195, United States
2 shared publicationsAndrew D. Ellington
Department of Molecular Biosciences, University of Texas at Austin, Austin, TX 78712
1 shared publication- Andrew D. Ellington
University of Texas at Austin
1 shared publication - Cameron Chalk
University of Texas at Austin
1 shared publication
Latest Publications
- Open Access
- 9 January 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (2) , eadx3969
Molecular computation at equilibrium via programmable entropy
Synthetic molecular information processing is typically designed through programming kinetic pathways, so that molecules bind, unbind, or incur conformational changes in some desired order. We demonstrate an alternative paradigm in dynamic DNA nanotechnology that programs the thermodynamic equilibrium state directly, with computation emerging from entropic driving forces. Like declarative programming in computer science, this approach emphasizes desired outcomes rather than specific steps, simplifying molecular programming and avoiding errors caused when thermodynamic forces work against programmed kinetics. We show broad applicability through three distinct applications: reversible signal propagation with fan-in and fan-out, algorithmic self-assembly performing Boolean logic, and synthesis of molecular chains (concatemers) of programmable length, illustrating how thermodynamic computation can enable practical molecular engineering tasks. Our work may enable previously unexplored ways to engineer complex molecular behaviors and help inform the understanding of the computational power of thermodynamics versus kinetics for molecular systems.
- 9 January 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (2) , eadx3969
Open AccessMolecular computation at equilibrium via programmable entropy
Synthetic molecular information processing is typically designed through programming kinetic pathways, so that molecules bind, unbind, or incur conformational changes in some desired order. We demonstrate an alternative paradigm in dynamic DNA nanotechnology that programs the thermodynamic equilibrium state directly, with computation emerging from entropic driving forces. Like declarative programming in computer science, this approach emphasizes desired outcomes rather than specific steps, simplifying molecular programming and avoiding errors caused when thermodynamic forces work against programmed kinetics. We show broad applicability through three distinct applications: reversible signal propagation with fan-in and fan-out, algorithmic self-assembly performing Boolean logic, and synthesis of molecular chains (concatemers) of programmable length, illustrating how thermodynamic computation can enable practical molecular engineering tasks. Our work may enable previously unexplored ways to engineer complex molecular behaviors and help inform the understanding of the computational power of thermodynamics versus kinetics for molecular systems.
- Open Access
Molecular computation at equilibrium via programmable entropy
Synthetic molecular information processing is typically designed through programming kinetic pathways, so that molecules bind, unbind, or incur conformational changes in some desired order. In DNA nanotechnology, this paradigm is exemplified by strand displacement cascades that control signal transmission through toehold sequestering, and algorithmic tile assembly where correct computation emerges from enforcing ordered growth. In contrast, thermodynamic programming focuses solely on the desired end-state rather than the path, often allowing simpler reasoning and requiring fewer parameters, as well as avoiding energetically-favored, yet undesired, error states that often frustrate kinetic approaches. Here we demonstrate a thermodynamics-first paradigm based on the Thermodynamic Binding Networks (TBN) model, where the system’s equilibrium is determined by two simple factors: maximizing the number of complementary domain-level bonds while favoring configurations with more separate molecular complexes. We first validate the model by quantitatively measuring the free energy benefit of configurations with more separate complexes but identical binding, confirming the entropic driving force central to the TBN abstraction. We then construct signal propagation circuits including fan-in and fan-out, seeded-assembly systems that perform Boolean logic computation, and systems for synthesis of concatemers of size quadratic in that of the substrates (by computing their least common multiple). Realizing these TBN constructions required addressing experimental challenges including ensuring geometric feasibility of desired complexes through systematic domain ordering and compensating for multi-arm junction penalties. Our work may enable new ways to engineer complex molecular behaviors and help inform the understanding of the computational power of kinetics versus thermodynamics for molecular systems.
Open AccessMolecular computation at equilibrium via programmable entropy
Synthetic molecular information processing is typically designed through programming kinetic pathways, so that molecules bind, unbind, or incur conformational changes in some desired order. In DNA nanotechnology, this paradigm is exemplified by strand displacement cascades that control signal transmission through toehold sequestering, and algorithmic tile assembly where correct computation emerges from enforcing ordered growth. In contrast, thermodynamic programming focuses solely on the desired end-state rather than the path, often allowing simpler reasoning and requiring fewer parameters, as well as avoiding energetically-favored, yet undesired, error states that often frustrate kinetic approaches. Here we demonstrate a thermodynamics-first paradigm based on the Thermodynamic Binding Networks (TBN) model, where the system’s equilibrium is determined by two simple factors: maximizing the number of complementary domain-level bonds while favoring configurations with more separate molecular complexes. We first validate the model by quantitatively measuring the free energy benefit of configurations with more separate complexes but identical binding, confirming the entropic driving force central to the TBN abstraction. We then construct signal propagation circuits including fan-in and fan-out, seeded-assembly systems that perform Boolean logic computation, and systems for synthesis of concatemers of size quadratic in that of the substrates (by computing their least common multiple). Realizing these TBN constructions required addressing experimental challenges including ensuring geometric feasibility of desired complexes through systematic domain ordering and compensating for multi-arm junction penalties. Our work may enable new ways to engineer complex molecular behaviors and help inform the understanding of the computational power of kinetics versus thermodynamics for molecular systems.
- Open Access
- 5 September 2023
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 120 (37)
Parallel molecular computation on digital data stored in DNA
DNA is an incredibly dense storage medium for digital data. However, computing on the stored information is expensive and slow, requiring rounds of sequencing, in silico computation, and DNA synthesis. Prior work on accessing and modifying data using DNA hybridization or enzymatic reactions had limited computation capabilities. Inspired by the computational power of “DNA strand displacement,” we augment DNA storage with “in-memory” molecular computation using strand displacement reactions to algorithmically modify data in a parallel manner. We show programs for binary counting and Turing universal cellular automaton Rule 110, the latter of which is, in principle, capable of implementing any computer algorithm. Information is stored in the nicks of DNA, and a secondary sequence-level encoding allows high-throughput sequencing-based readout. We conducted multiple rounds of computation on 4-bit data registers, as well as random access of data (selective access and erasure). We demonstrate that large strand displacement cascades with 244 distinct strand exchanges (sequential and in parallel) can use naturally occurring DNA sequence from M13 bacteriophage without stringent sequence design, which has the potential to improve the scale of computation and decrease cost. Our work merges DNA storage and DNA computing, setting the foundation of entirely molecular algorithms for parallel manipulation of digital information preserved in DNA.
- 5 September 2023
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 120 (37)
Open AccessParallel molecular computation on digital data stored in DNA
DNA is an incredibly dense storage medium for digital data. However, computing on the stored information is expensive and slow, requiring rounds of sequencing, in silico computation, and DNA synthesis. Prior work on accessing and modifying data using DNA hybridization or enzymatic reactions had limited computation capabilities. Inspired by the computational power of “DNA strand displacement,” we augment DNA storage with “in-memory” molecular computation using strand displacement reactions to algorithmically modify data in a parallel manner. We show programs for binary counting and Turing universal cellular automaton Rule 110, the latter of which is, in principle, capable of implementing any computer algorithm. Information is stored in the nicks of DNA, and a secondary sequence-level encoding allows high-throughput sequencing-based readout. We conducted multiple rounds of computation on 4-bit data registers, as well as random access of data (selective access and erasure). We demonstrate that large strand displacement cascades with 244 distinct strand exchanges (sequential and in parallel) can use naturally occurring DNA sequence from M13 bacteriophage without stringent sequence design, which has the potential to improve the scale of computation and decrease cost. Our work merges DNA storage and DNA computing, setting the foundation of entirely molecular algorithms for parallel manipulation of digital information preserved in DNA.
- 29 April 2023
- Published by Elsevier in Trends in Biotechnology
- Vol. 41 (7) , 851-852
Molecular information technology with DNA
- 29 April 2023
- Published by Elsevier in Trends in Biotechnology
- Vol. 41 (7) , 851-852
Molecular information technology with DNA
- Open Access
- 4 April 2023
- Published by American Chemical Society (ACS) in ACS Synthetic Biology
- Vol. 12 (4) , 993-1006
Speed and Correctness Guarantees for Programmable Enthalpy-Neutral DNA Reactions
- 4 April 2023
- Published by American Chemical Society (ACS) in ACS Synthetic Biology
- Vol. 12 (4) , 993-1006
Open AccessSpeed and Correctness Guarantees for Programmable Enthalpy-Neutral DNA Reactions
- Open Access
Parallel molecular computation on digital data stored in DNA
DNA is an incredibly dense storage medium for digital data, but computing on the stored information is expensive and slow (rounds of sequencing, in silico computation, and DNA synthesis). Augmenting DNA storage with “in-memory” molecular computation, we use strand displacement reactions to algorithmically modify data stored in the topological modification of DNA. A secondary sequence-level encoding allows high-throughput sequencing-based readout. We show multiple rounds of binary counting and cellular automaton Rule 110 computation on 4-bit data registers, as well as selective access and erasure. Avoiding stringent sequence design, we demonstrate large strand displacement cascades (122 distinct steps) on naturally-occurring DNA sequences. Our work merges DNA storage and DNA computing, setting the foundation of entirely molecular algorithms for parallel manipulation of digital information kept in DNA.
Open AccessParallel molecular computation on digital data stored in DNA
DNA is an incredibly dense storage medium for digital data, but computing on the stored information is expensive and slow (rounds of sequencing, in silico computation, and DNA synthesis). Augmenting DNA storage with “in-memory” molecular computation, we use strand displacement reactions to algorithmically modify data stored in the topological modification of DNA. A secondary sequence-level encoding allows high-throughput sequencing-based readout. We show multiple rounds of binary counting and cellular automaton Rule 110 computation on 4-bit data registers, as well as selective access and erasure. Avoiding stringent sequence design, we demonstrate large strand displacement cascades (122 distinct steps) on naturally-occurring DNA sequences. Our work merges DNA storage and DNA computing, setting the foundation of entirely molecular algorithms for parallel manipulation of digital information kept in DNA.
- Open Access
Speed and correctness guarantees for programmable enthalpy-neutral DNA reactions
Molecular control circuits embedded within chemical systems to direct molecular events have transformative applications in synthetic biology, medicine, and other fields. However, it is challenging to understand the collective behavior of components due to the combinatorial complexity of possible interactions. Some of the largest engineered molecular systems to date have been constructed from DNA strand displacement reactions, in which signals can be propagated without a net change in base pairs. For linear chains of such enthalpy-neutral displacement reactions, we develop a rigorous framework to reason about interactions between regions that must be complementary. We then analyze desired and undesired properties affecting speed and correctness of such systems, including the spurious release of output (leak) and reversible unproductive binding (toehold occlusion), and experimentally confirm the predictions. Our approach, analogous to the rigorous proofs of algorithm correctness in computer science, can guide engineering of robust and efficient molecular algorithms.
Open AccessSpeed and correctness guarantees for programmable enthalpy-neutral DNA reactions
Molecular control circuits embedded within chemical systems to direct molecular events have transformative applications in synthetic biology, medicine, and other fields. However, it is challenging to understand the collective behavior of components due to the combinatorial complexity of possible interactions. Some of the largest engineered molecular systems to date have been constructed from DNA strand displacement reactions, in which signals can be propagated without a net change in base pairs. For linear chains of such enthalpy-neutral displacement reactions, we develop a rigorous framework to reason about interactions between regions that must be complementary. We then analyze desired and undesired properties affecting speed and correctness of such systems, including the spurious release of output (leak) and reversible unproductive binding (toehold occlusion), and experimentally confirm the predictions. Our approach, analogous to the rigorous proofs of algorithm correctness in computer science, can guide engineering of robust and efficient molecular algorithms.