SWSiyuan Stella Wang

Siyuan Stella Wang

*This is an algorithmically generated author record based on publicly available information.

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


Siyuan Stella Wang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A computational framework for designing micron-scale crisscross DNA megastructures

    by Matthew Aquilina, Florian Katzmeier, Minke A. D. Nijenhuis, Siyuan Stella Wang, Corey Becker, Yichen Zhao, Su Hyun Seok, Julie Finkel, Huangchen Cui, Jaewon Lee, et al.

    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.


  • Open Access

    Parallel molecular computation on digital data stored in DNA

    by Boya Wang, Siyuan Stella Wang, Cameron Chalk, Andrew D. Ellington, David Soloveichik

    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.


  • Open Access

    Developing predictive hybridization models for phosphorothioate oligonucleotides using high-resolution melting

    by Siyuan S. Wang, Erhu Xiong, Sanchita Bhadra, Andrew D. Ellington

    The ability to predict nucleic acid hybridization energies has been greatly enabling for many applications, but predictive models require painstaking experimentation, which may limit expansion to non-natural nucleic acid analogues and chemistries. We have assessed the utility of dye-based, high-resolution melting (HRM) as an alternative to UV-Vis determinations of hyperchromicity in order to more quickly acquire parameters for duplex stability prediction. The HRM-derived model for phosphodiester (PO) DNA can make comparable predictions to previously established models. Using HRM, it proved possible to develop predictive models for DNA duplexes containing phosphorothioate (PS) linkages, and we found that hybridization stability could be predicted as a function of sequence and backbone composition for a variety of duplexes, including PS:PS, PS:PO, and partially modified backbones. Individual phosphorothioate modifications destabilize helices by around 0.12 kcal/mol on average. Finally, we applied these models to the design of a catalytic hairpin assembly circuit, an enzyme-free amplification method used for nucleic acid-based molecular detection. Changes in PS circuit behavior were consistent with model predictions, further supporting the addition of HRM modeling and parameters for PS oligonucleotides to the rational design of nucleic acid hybridization.


  • Recovery of Information Stored in Modified DNA with an Evolved Polymerase

    by Raghav Shroff, Jared W. Ellefson, Siyuan S. Wang, Alexander A. Boulgakov, Randall A. Hughes, Andrew D. Ellington

    DNA is increasingly being explored as an alternative medium for digital information storage, but the potential information loss from degradation and associated issues with error during reading challenge its wide-scale implementation. To address this, we propose an atomic-scale encoding standard for DNA, where information is encoded in degradation-resistant analogues of natural nucleic acids (xNAs). To better enable this approach, we used directed evolution to create a polymerase capable of transforming 2′-O-methyl templates into double-stranded DNA. Starting from a thermophilic, error-correcting reverse transcriptase, RTX, we evolved an enzyme (RTX-Ome v6) that relies on a fully functional proofreading domain to correct mismatches on DNA, RNA, and 2′-O-methyl templates. In addition, we implemented a downstream analysis strategy that accommodates deletions that arise during phosphoramidite synthesis, the most common type of synthesis error. By coupling and integrating new chemistries, enzymes, and algorithms, we further enable the large-scale use of nucleic acids for information storage.


  • Pattern Generation with Nucleic Acid Chemical Reaction Networks

    by Siyuan S. Wang, Andrew D. Ellington

    Biological and biochemical systems are manifestations of chemical reaction networks (CRNs). The ability to design and engineer such networks may allow the construction of artificial systems that are as complex as those seen in biology, opening the way to translational possibilities including adaptive materials. One venue for progress is the design of autonomous systems capable of pattern generation; however many synthetic CRNs, such as the Belousov–Zhabotinsky reaction, cannot be rewired to encode more complex interactions and thus lack the capacity for more detailed engineering algorithms. In contrast, DNA is an information-rich molecule with predictable and reliable base-pairing interactions and well-studied kinetics, and the use of DNA has greatly enabled the rational design of much more complex synthetic CRNs. Recent advances in the DNA computing field include circuits for pattern transformation, an example of self-organization. An arsenal of tools for designing DNA circuits to implement various CRNs has been developed by DNA nanotechnologists, including software to reliably program strand-displacement nucleic acid circuits. In addition, DNA walkers can be used to create CRNs with controlled diffusivity, while DNA gels similarly represent a new medium for implementing CRNs that may ultimately lead to the development of smart materials. As we will argue, future endeavors in nucleic acid-based pattern generation will be most greatly advanced by harnessing well-known enzymatic processes to serve as generators and amplifiers. Once nucleic acid computing tools are further developed to expedite the design process of pattern generation, we anticipate a transition from proof-of-concept curiosities to application-driven inquiries.