Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

All-DNA finite-state automata with finite memory.

ABSTRACT: Biomolecular logic devices can be applied for sensing and nano-medicine. We built three DNA tweezers that are activated by the inputs H(+)/OH(-); ; nucleic acid linker/complementary antilinker to yield a 16-states finite-state automaton. The outputs of the automata are the configuration of the respective tweezers (opened or closed) determined by observing fluorescence from a fluorophore/quencher pair at the end of the arms of the tweezers. The system exhibits a memory because each current state and output depend not only on the source configuration but also on past states and inputs.

SUBMITTER: Wang ZG

PROVIDER: S-EPMC3009826 | biostudies-literature | 2010 Dec

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

All-DNA finite-state automata with finite memory.

Wang Zhen-Gang ZG Elbaz Johann J Remacle F F Levine R D RD Willner Itamar I

Proceedings of the National Academy of Sciences of the United States of America 20101206 51

Biomolecular logic devices can be applied for sensing and nano-medicine. We built three DNA tweezers that are activated by the inputs H(+)/OH(-); ; nucleic acid linker/complementary antilinker to yield a 16-states finite-state automaton. The outputs of the automata are the configuration of the respective tweezers (opened or closed) determined by observing fluorescence from a fluorophore/quencher pair at the end of the arms of the tweezers. The system exhibits a memory because each current state ...[more]

PMID: 21135212

Similar Datasets

Approaching Arithmetic Theories with Finite-State Automata

Project description:The automata-theoretic approach provides an elegant method for deciding linear arithmetic theories. This approach has recently been instrumental for settling long-standing open problems about the complexity of deciding the existential fragments of Büchi arithmetic and linear arithmetic over p-adic fields. In this article, which accompanies an invited talk, we give a high-level exposition of the NP upper bound for existential Büchi arithmetic, obtain some derived results, and further discuss some open problems.

| S-EPMC7206625 | biostudies-literature

Robust finite automata in stochastic chemical reaction networks.

Project description:Finite-state automata (FSA) are simple computational devices that can nevertheless illustrate interesting behaviours. We propose that FSA can be employed as control circuits for engineered stochastic biological and biomolecular systems. We present an implementation of FSA using counts of chemical species in the range of hundreds to thousands, which is relevant for the counts of many key molecules such as mRNAs in prokaryotic cells. The challenge here is to ensure a robust representation of the current state in the face of stochastic noise. We achieve this by using a multistable approximate majority algorithm to stabilize and store the current state of the system. Arbitrary finite state machines can thus be compiled into robust stochastic chemical automata. We present two variants: one that consumes its input signals to initiate state transitions and one that does not. We characterize the state change dynamics of these systems and demonstrate their application to solve the four-bit binary square root problem. Our work lays the foundation for the use of chemical automata as control circuits in bioengineered systems and biorobotics.

| S-EPMC8692961 | biostudies-literature

How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines.

Project description:Every problem in computing can be cast as decision problems of whether strings are in a language or not. Computations and language recognition are carried out by three classes of automata, the most complex of which is the Turing machine. Living systems compute using biochemistry; in the artificial, computation today is mostly electronic. Thinking of chemical reactions as molecular recognition machines, and without using biochemistry, we realize one automaton in each class by means of one-pot, table top chemical reactors: from the simplest, Finite automata, to the most complex, Turing machines. Language acceptance/rejection criteria by automata can be formulated using energy considerations. Our Turing machine uses the Belousov-Zhabotinsky chemical reaction and checks the same symbol in an Avogadro's number of processors. Our findings have implications for chemical and general computing, artificial intelligence, bioengineering, the study of the origin and presence of life on other planets, and for artificial biology.

| S-EPMC6710637 | biostudies-literature

Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information.

Project description:Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state set of the DFA is partitioned into many blocks. In the second phase, the state set is refined using a hash table. The minimization algorithm has a lower time complexity O(n) than a naive comparison of transitions O(n2). Few states need to be refined by the hash table, because most states have been partitioned by the backward depth information in the coarse partition. This method achieves greater generality than previous methods because building the backward depth information is independent of the topological complexity of the DFA. The proposed algorithm can be applied not only to the minimization of acyclic automata or simple cyclic automata, but also to automata with high topological complexity. Overall, the proposal has three advantages: lower time complexity, greater generality, and scalability. A comparison to Hopcroft's algorithm demonstrates experimentally that the algorithm runs faster than traditional algorithms.

| S-EPMC5091862 | biostudies-literature

A localized DNA finite-state machine with temporal resolution.

Project description:The identity and timing of environmental stimulus play a pivotal role in living organisms in programming their signaling networks and developing specific phenotypes. The ability to unveil history-dependent signals will advance our understanding of temporally regulated biological processes. Here, we have developed a two-input, five-state DNA finite-state machine (FSM) to sense and record the temporally ordered inputs. The spatial organization of the processing units on DNA origami enables facile modulation of the energy landscape of DNA strand displacement reactions, allowing precise control of the reactions along predefined paths for different input orders. The use of spatial constraints brings about a simple, modular design for the FSM with a minimum set of orthogonal components and confers minimized leaky reactions and fast kinetics. The FSM demonstrates the capability of sensing the temporal orders of two microRNAs, highlighting its potential for temporally resolved biosensing and smart therapeutics.

| S-EPMC8956261 | biostudies-literature

Porosity of the porous carbonate rocks in the Jingfengqiao-Baidiao area based on finite automata.

Project description:This study is based on the processing of computed microtomography images of rock samples. In this study, a finite automation is constructed using the grey value, red-green-blue (RGB) value and Euler number of polarized images of carbonate rocks from the Jingfengqiao-Baidiao area. The finite automaton is used to perform black and white binary processing of the polarized images of the carbonate rocks. The porosity of the carbonate rock is calculated based on the black and white binarization processing results of the polarized images of the carbonate rocks. The obtained porosity is compared with the carbonate porosity obtained by use of the traditional carbonate research method. When the two porosities are close, the image processing threshold of the finite automata is considered to be credible. Based on the finite automata established using the image processing threshold, the black and white binary images of the polarized images of the carbonate rocks are used to establish a rock pore image using ImageJ2X. The polarized images of the carbonate rocks are classified according to their RGB values using the finite automata for the porosity classification, and the obtained images are used as textures to paste onto a cube to construct a three-dimensional data model of the carbonate rocks. This study also uses 16S rDNA analysis to verify the formation mechanism of the carbonate pores in the Jingfengqiao-Baidiao area. The results of the 16S rDNA analysis show that the pores in the carbonate rocks in the Jingfengqiao-Baidiao area are closely related to microorganisms, represented by denitrifying bacteria.

| S-EPMC8753174 | biostudies-literature

A DNA Finite-State Machine Based on the Programmable Allosteric Strategy of DNAzyme.

Project description:Living organisms can produce corresponding functions by responding to external and internal stimuli, and this irritability plays a pivotal role in nature. Inspired by such natural temporal responses, the development and design of nanodevices with the ability to process time-related information could facilitate the development of molecular information processing systems. Here, we proposed a DNA finite-state machine that can dynamically respond to sequential stimuli signals. To build this state machine, a programmable allosteric strategy of DNAzyme was developed. This strategy performs the programmable control of DNAzyme conformation using a reconfigurable DNA hairpin. Based on this strategy, we first implemented a finite-state machine with two states. Through the modular design of the strategy, we further realized the finite-state machine with five states. The DNA finite-state machine endows molecular information systems with the ability of reversible logic control and order detection, which can be extended to more complex DNA computing and nanomachines to promote the development of dynamic nanotechnology.

| S-EPMC9963683 | biostudies-literature

Self-propelling colloids with finite state dynamics.

Project description:Endowing materials with the ability to sense, adapt, and respond to stimuli holds the key to a progress leap in autonomous systems. In spite of the growing success of macroscopic soft robotic devices, transferring these concepts to the microscale presents several challenges connected to the lack of suitable fabrication and design techniques and of internal response schemes that connect the materials' properties to the function of the active units. Here, we realize self-propelling colloidal clusters which possess a finite number of internal states, which define their motility and which are connected by reversible transitions. We produce these units via capillary assembly combining hard polystyrene colloids with two different types of thermoresponsive microgels. The clusters, actuated by spatially uniform AC electric fields, adapt their shape and dielectric properties, and consequently their propulsion, via reversible temperature-induced transitions controlled by light. The different transition temperatures for the two microgels enable three distinct dynamical states corresponding to three illumination intensity levels. The sequential reconfiguration of the microgels affects the velocity and shape of the active trajectories according to a pathway defined by tailoring the clusters' geometry during assembly. The demonstration of these simple systems indicates an exciting route toward building more complex units with broader reconfiguration schemes and multiple responses as a step forward in the pursuit of adaptive autonomous systems at the colloidal scale.

| S-EPMC10089169 | biostudies-literature

The evolutionary origin of Bayesian heuristics and finite memory.

Project description:Bayes' rule is a fundamental principle that has been applied across multiple disciplines. However, few studies have addressed its origin as a cognitive strategy or the underlying basis for generalization from a small sample. Using a simple binary choice model subject to natural selection, we derive Bayesian inference as an adaptive behavior under certain stochastic environments. Such behavior emerges purely through the forces of evolution, despite the fact that our population consists of mindless individuals without any ability to reason, act strategically, or accurately encode or infer environmental states probabilistically. In addition, three specific environments favor the emergence of finite memory-those that are Markov, nonstationary, and environments where sampling contains too little or too much information about local conditions. These results provide an explanation for several known phenomena in human cognition, including deviations from the optimal Bayesian strategy and finite memory beyond resource constraints.

| S-EPMC8340130 | biostudies-literature

Nanowire nanocomputer as a finite-state machine.

Project description:Implementation of complex computer circuits assembled from the bottom up and integrated on the nanometer scale has long been a goal of electronics research. It requires a design and fabrication strategy that can address individual nanometer-scale electronic devices, while enabling large-scale assembly of those devices into highly organized, integrated computational circuits. We describe how such a strategy has led to the design, construction, and demonstration of a nanoelectronic finite-state machine. The system was fabricated using a design-oriented approach enabled by a deterministic, bottom-up assembly process that does not require individual nanowire registration. This methodology allowed construction of the nanoelectronic finite-state machine through modular design using a multitile architecture. Each tile/module consists of two interconnected crossbar nanowire arrays, with each cross-point consisting of a programmable nanowire transistor node. The nanoelectronic finite-state machine integrates 180 programmable nanowire transistor nodes in three tiles or six total crossbar arrays, and incorporates both sequential and arithmetic logic, with extensive intertile and intratile communication that exhibits rigorous input/output matching. Our system realizes the complete 2-bit logic flow and clocked control over state registration that are required for a finite-state machine or computer. The programmable multitile circuit was also reprogrammed to a functionally distinct 2-bit full adder with 32-set matched and complete logic output. These steps forward and the ability of our unique design-oriented deterministic methodology to yield more extensive multitile systems suggest that proposed general-purpose nanocomputers can be realized in the near future.

| S-EPMC3932892 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data