Ternary DNA computing using 3 × 3 multiplication matrices.
Ontology highlight
ABSTRACT:
SUBMITTER: Orbach R
PROVIDER: S-EPMC5811156 | biostudies-literature | 2015 Feb
REPOSITORIES: biostudies-literature
Publications
Ternary DNA computing using 3 × 3 multiplication matrices.
Orbach Ron R Lilienthal Sivan S Klein Michael M Levine R D RD Remacle Francoise F Willner Itamar I
Chemical science 20141114 2
Non-Boolean computations implementing operations on multi-valued variables beyond base 2 allow enhanced computational complexity. We introduce DNA as a functional material for ternary computing, and in particular demonstrate the use of three-valued oligonucleotide inputs to construct a 3 × 3 multiplication table. The system consists of two three-valued inputs of -1; 0; +1 and a fluorophore/quencher functional hairpin acting as computational and reporter module. The interaction of the computation ...[more]
Similar Datasets
Project description:This paper discusses the implementation of mathematical functions such as exponentials, trigonometric functions, the sigmoid function and the perceptron function with molecular reactions in general, and DNA strand displacement reactions in particular. The molecular constructs for these functions are predicated on a novel representation for input and output values: a fractional encoding, in which values are represented by the relative concentrations of two molecular types, denoted as type-1 and type-0. This representation is inspired by a technique from digital electronic design, termed stochastic logic, in which values are represented by the probability of 1's in a stream of randomly generated 0's and 1's. Research in the electronic realm has shown that a variety of complex functions can be computed with remarkably simple circuitry with this stochastic approach. This paper demonstrates how stochastic electronic designs can be translated to molecular circuits. It presents molecular implementations of mathematical functions that are considerably more complex than any shown to date. All designs are validated using mass-action simulations of the chemical kinetics of DNA strand displacement reactions.
| S-EPMC5974329 | biostudies-literature
Project description:The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman 'there's plenty of room at the bottom'. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world's current fastest supercomputer, while consuming a tiny fraction of its energy.
| S-EPMC5378132 | biostudies-literature
Project description:BACKGROUND: The rapid increase in the amount of protein and DNA sequence information available has become almost overwhelming to researchers. So much information is now accessible that high-quality, functional gene analysis and categorization has become a major goal for many laboratories. To aid in this categorization, there is a need for non-commercial software that is able to both align sequences and also calculate pairwise levels of similarity/identity. RESULTS: We have developed MatGAT (Matrix Global Alignment Tool), a simple, easy to use computer application that generates similarity/identity matrices for DNA or protein sequences without needing pre-alignment of the data. CONCLUSIONS: The advantages of this program over other software are that it is open-source freeware, can analyze a large number of sequences simultaneously, can visualize both sequence alignment and similarity/identity values concurrently, employs global alignment in calculations, and has been formatted to run under both the Unix and the Microsoft Windows Operating Systems. We are presently completing the Macintosh-based version of the program.
| S-EPMC166169 | biostudies-literature
Project description:In the study of complex genetic diseases, the identification of subgroups of patients sharing similar genetic characteristics represents a challenging task, for example, to improve treatment decision. One type of genetic lesion, frequently investigated in such disorders, is the change of the DNA copy number (CN) at specific genomic traits. Non-negative Matrix Factorization (NMF) is a standard technique to reduce the dimensionality of a data set and to cluster data samples, while keeping its most relevant information in meaningful components. Thus, it can be used to discover subgroups of patients from CN profiles. It is however computationally impractical for very high dimensional data, such as CN microarray data. Deciding the most suitable number of subgroups is also a challenging problem. The aim of this work is to derive a procedure to compact high dimensional data, in order to improve NMF applicability without compromising the quality of the clustering. This is particularly important for analyzing high-resolution microarray data. Many commonly used quality measures, as well as our own measures, are employed to decide the number of subgroups and to assess the quality of the results. Our measures are based on the idea of identifying robust subgroups, inspired by biologically/clinically relevance instead of simply aiming at well-separated clusters. We evaluate our procedure using four real independent data sets. In these data sets, our method was able to find accurate subgroups with individual molecular and clinical features and outperformed the standard NMF in terms of accuracy in the factorization fitness function. Hence, it can be useful for the discovery of subgroups of patients with similar CN profiles in the study of heterogeneous diseases.
| S-EPMC3835832 | biostudies-literature
Project description:The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM). This problem arises in various scientific applications such as in electronics, robotics, mathematical programing, and cryptography. For CMMP the researchers have proposed various techniques such as dynamic approach, arithmetic approach, and sequential multiplication. However, these techniques are deficient for providing optimal results for CMMP in terms of computational time and significant amount of scalar multiplication. In this article, we proposed a new model to minimize the Chain Matrix Multiplication (CMM) operations based on group counseling optimizer (GCO). Our experimental results and their analysis show that the proposed GCO model has achieved significant reduction of time with efficient speed when compared with sequential chain matrix multiplication approach. The proposed model provides good performance and reduces the multiplication operations varying from 45% to 96% when compared with sequential multiplication. Moreover, we evaluate our results with the best known dynamic programing and arithmetic multiplication approaches, which clearly demonstrate that proposed model outperforms in terms of computational time and space complexity.
| S-EPMC7959611 | biostudies-literature
Project description:Recent efforts in synthetic biology have focussed on the implementation of logical functions within living cells. One aim is to facilitate both internal "re-programming" and external control of cells, with potential applications in a wide range of domains. However, fundamental limitations on the degree to which single cells may be re-engineered have led to a growth of interest in multicellular systems, in which a "computation" is distributed over a number of different cell types, in a manner analogous to modern computer networks. Within this model, individual cell type perform specific sub-tasks, the results of which are then communicated to other cell types for further processing. The manner in which outputs are communicated is therefore of great significance to the overall success of such a scheme. Previous experiments in distributed cellular computation have used global communication schemes, such as quorum sensing (QS), to implement the "wiring" between cell types. While useful, this method lacks specificity, and limits the amount of information that may be transferred at any one time. We propose an alternative scheme, based on specific cell-cell conjugation. This mechanism allows for the direct transfer of genetic information between bacteria, via circular DNA strands known as plasmids. We design a multi-cellular population that is able to compute, in a distributed fashion, a Boolean XOR function. Through this, we describe a general scheme for distributed logic that works by mixing different strains in a single population; this constitutes an important advantage of our novel approach. Importantly, the amount of genetic information exchanged through conjugation is significantly higher than the amount possible through QS-based communication. We provide full computational modelling and simulation results, using deterministic, stochastic and spatially-explicit methods. These simulations explore the behaviour of one possible conjugation-wired cellular computing system under different conditions, and provide baseline information for future laboratory implementations.
| S-EPMC3688716 | biostudies-literature
Project description:The baculovirus Autographa californica multicapsid nucleopolyhedrovirus (AcMNPV) initiates apoptosis in diverse insects through events triggered by virus DNA (vDNA) replication. To define the proapoptotic pathway and its role in antivirus defense, we investigated the link between the host's DNA damage response (DDR) and apoptosis. We report here that AcMNPV elicits a DDR in the model insect Drosophila melanogaster. Replication of vDNA activated DDR kinases, as evidenced by ATM-driven phosphorylation of the Drosophila histone H2AX homolog (H2Av), a critical regulator of the DDR. Ablation or inhibition of ATM repressed H2Av phosphorylation and blocked virus-induced apoptosis. The DDR kinase inhibitors caffeine and KU55933 also prevented virus-induced apoptosis in cells derived from the permissive AcMNPV host, Spodoptera frugiperda. This block occurred at a step upstream of virus-mediated depletion of the cellular inhibitor-of-apoptosis protein, an event that initiates apoptosis in Spodoptera and Drosophila. Thus, the DDR is a conserved, proapoptotic response to baculovirus infection. DDR inhibition also repressed vDNA replication and reduced virus yields 100,000-fold, demonstrating that the DDR contributes to virus production, despite its recognized antivirus role. In contrast to virus-induced phosphorylation of Drosophila H2Av, AcMNPV blocked phosphorylation of the Spodoptera H2AX homolog (SfH2AX). Remarkably, AcMNPV also suppressed SfH2AX phosphorylation following pharmacologically induced DNA damage. These findings indicate that AcMNPV alters canonical DDR signaling in permissive cells. We conclude that AcMNPV triggers a proapoptotic DDR that is subsequently modified, presumably to stimulate vDNA replication. Thus, manipulation of the DDR to facilitate multiplication is an evolutionarily conserved strategy among DNA viruses of insects and mammals.
| S-EPMC3503141 | biostudies-literature
Project description:In the social and behavioral sciences, it is recommended that effect sizes and their sampling variances be reported. Formulas for common effect sizes such as standardized and raw mean differences, correlation coefficients, and odds ratios are well known and have been well studied. However, the statistical properties of multivariate effect sizes have received less attention in the literature. This study shows how structural equation modeling (SEM) can be used to compute multivariate effect sizes and their sampling covariance matrices. We focus on the standardized mean difference (multiple-treatment and multiple-endpoint studies) with or without the assumption of the homogeneity of variances (or covariance matrices) in this study. Empirical examples were used to illustrate the procedures in R. Two computer simulation studies were used to evaluate the empirical performance of the SEM approach. The findings suggest that in multiple-treatment and multiple-endpoint studies, when the assumption of the homogeneity of variances (or covariance matrices) is questionable, it is preferable not to impose this assumption when estimating the effect sizes. Implications and further directions are discussed.
| S-EPMC6107852 | biostudies-literature
Project description:In the past decades, metasurfaces have opened up a promising venue for manipulating lights and electromagnetic (EM) waves. In the field of nonlinearity, second-harmonic generation (SHG) is a research focus due to its diverse applications. There have been many researches for realizing SHG in optical regime using nonlinear characteristics of optical materials, but its efficiency is low. In microwave frequencies, SHGs are basically studied in the guided-wave systems. Here, high-efficiency SHGs of spatial waves are presented in the microwave frequency using nonlinear metasurface loaded with active chips at the subwavelength scale. The nonlinear meta-atom is composed of receiving antenna, transmitting antenna, and active circuit of frequency multiplier, which can realize strongly nonlinear response and link the EM signals from the receiving to transmitting antennas. Correspondingly, to achieve the function of spatial-wave frequency multiplication, the working frequency of the transmitting antenna in the meta-atom should be twice as that of the receiving antenna, and hence the active chip is well matched to obtain the signal transforming with high efficiency. Good performance of the spatial-wave frequency multiplication is demonstrated in the proof-of-concept experiments with the best transform efficiency of 85.11% under normal incidence, validating the proposed method.
| S-EPMC8456279 | biostudies-literature
Project description:Genetic similarity is a measure of the genetic relatedness among individuals. The standard method for computing these matrices involves the inner product of observed genetic variants. Such an approach is inaccurate or impossible if genotypes are not available, or not densely sampled, or of poor quality (e.g., genetic analysis of extinct species). We provide a new method for computing genetic similarities among individuals using phylogenetic trees. Our method can supplement (or stand in for) computations based on genotypes. We provide simulations suggesting that the genetic similarity matrices computed from trees are consistent with those computed from genotypes. With our methods, quantitative analysis on genetic traits and analysis of heritability and coheritability can be conducted directly using genetic similarity matrices and so in the absence of genotype data, or under uncertainty in the phylogenetic tree. We use simulation studies to demonstrate the advantages of our method, and we provide applications to data.
| S-EPMC8219189 | biostudies-literature