Search

Dynamic regulation of DNA origami nanostructures is important for the fabrication of intelligent DNA nanodevices. Toehold-mediated strand displacement is a common regulation strategy, which utilizes trigger strands to assemble and disassemble nanostructures. Such trigger strands are required to be completely complementary to the corresponding substrate strands, which strictly demands orthogonality and accuracy of the sequence design. Herein, we present a disassembly strategy of DNA origami dimers based on polymerase-triggered strand displacement, where the polymerase primers, as the trigger strands, were only partially complementary to the toehold region of the substrate strands. To demonstrate the programmability of trigger strands, we utilized primers with different sequence combination patterns to disassemble DNA origami dimers. The statistical summary of AFM images and fluorescence curves proved the feasibility of the new strategy. The utilization of polymerase-triggered strand displacement on the disassembly of DNA origami structures enriches the toolbox for the dynamic regulation of DNA nanostructures.

In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To find new borderlines between families of P systems that can solve them and the ones that cannot is an important task to tackle the P versus NP problem. Adding syntactic and/or semantic ingredients can mean passing from non-efficiency to presumed efficiency. Here, we try to get narrow frontiers, setting the stage to adapt efficient solutions from a family of P systems to another one. In order to do that, a solution to the problem is given by means of a family of tissue P systems with evolutional symport/antiport rules and cell separation with the restriction that both the left-hand side and the right-hand side of the rules have at most two objects; that is, with recognizer P systems from $${\mathcal {TSEC}}(2, 2)$$ TSEC ( 2 , 2 ) . This result improves a previous one, when 3 objects could be used in the left-hand side of the evolutional communication rules

The precursors of functional biomolecules in living cells are synthesized in a bottom-up manner and subsequently activated by modification into a delicate structure with near-atomic precision. DNA origami technology provides a promising way to mimic the synthesis of precursors, although mimicking the modification process is a challenge. Herein, a DNA paper-cutting (DNA kirigami) method to trim origami into designer nanostructures is proposed, where the modification is implemented by a polymerase-triggered DNA strand displacement reaction. Six geometric shapes are created by cutting rectangular DNA origami. Gel electrophoresis and atomic force microscopy results demonstrate the feasibility and capability of the DNA paper-cutting method. The proposed DNA paper-cutting strategy can enrich the toolbox for dynamically transforming DNA origami and has potential applications in biomimetics. .

Spiking neural P systems (SNP systems) are a class of distributed and parallel computation models, which are inspired by the way in which neurons process information by means of spikes, where a neuron fires and distributes the spikes to all the neurons linked by synapses with the firing neuron. In this work, a new spike distribution mechanism is introduced, where the produced spikes are distributed to a set of neurons indicated by the target indications. The computation power of SNP systems with this new spike distribution mechanism is investigated. It is demonstrated that SNP systems with such a distribution mechanism are Turing universal as both number generators and function computing devices. Moreover, it is shown that 6 neurons (respectively, 15 neurons) are sufficient for constructing a universal SNP system with the proposed spike distribution mechanism as a number generator (respectively, as a function computing device). By comparing with the classical one, it can be found that the proposed spike distribution mechanism is a powerful feature in terms of the number of neurons used to construct universal SNP systems.

Spiking neural P systems are a class of distributed parallel computing models, inspired by the way in which neurons process information and communicate with each other by means of spikes. In 2007, Freund and Verlan developed a formal framework for P systems to capture most of the essential features of P systems and to define their functioning in a formal way. In this work, we present an extension of the formal framework related to spiking neural P systems by considering the applicability of each rule to be controlled by specific conditions on the current contents of the cells. The main objective of this extension is to also capture spiking neural P systems in the formal framework. Another goal of our extension is to incorporate the notions of input and output. Finally, we also show that in the case of spiking neural P systems, the rules have a rather simple form and in that way spiking neural P systems correspond to vector addition systems where the application of rules is controlled by semi-linear sets.