Modeling DNA Nanodevices Using Graph Rewrite Systems
نویسندگان
چکیده
DNA based nanostructures and devices are becoming ubiquitous in nanotechnology with rapid advancements in theory and experiments in DNA self-assembly which have led to a myriad of DNA nanodevices. However, the modeling methods used by researchers in the field for design and analysis of DNA nanostructures and nanodevices have not progressed at the same rate. Specifically, there does not exist a formal system that can capture the spectrum of the most frequently intended chemical reactions on DNA nanostructures and nanodevices which have branched and pseudo-knotted structures. In this paper we introduce a graph rewriting system for modeling DNA nanodevices. We define pseudo-DNA nanostructures (PDNs), which describe the sequence information and secondary structure of DNA nanostructures, but exclude modeling of tertiary structures. We define a class of labeled graphs called DNA graphs, that provide a graph theoretic representation of PDNs. We introduce a set of graph rewrite rules that operate on DNA graphs. Our DNA graphs and graph rewrite rules provide a powerful and expressive way to model DNA nanostructures and their reactions. These rewrite rules model most conventional reactions on DNA nanostructures, which include hybridization, dehybridization, base-stacking, and a large family of enzymatic reactions. A subset of these rewrite rules would likely be used for a basic graph rewrite system modeling most DNA devices, which use just DNA hybridization reactions, whereas other of our rewrite rules could be incorporated as needed for DNA devices for example enzymic reactions. To ensure consistency of our systems, we define a subset of DNA graphs which we call well-formed DNA graphs, whose strands have consistent 5′ to 3′ polarity. We show that if we start with an input set of well-formed DNA graphs, our rewrite rules produce only well-formed DNA graphs. We give four detailed example applications of our graph rewriting system on (1) Yurke et al.’s DNA tweezer system, Reem Mokhtar Department of Computer Science, Duke University, Durham, USA e-mail: [email protected] Sudhanshu Garg · Hieu Bui · Tianqi Song · John Reif Department of Computer Science, Duke University, Durham, USA Harish Chandran Google, Mountain View, California, USA
منابع مشابه
Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java
6 798;:=A@B:DC Graph grammars and graph rewrite systems improved a lot towards practical usability during the last years. Nevertheless, there are still major problems to overcome in order to attract a broad number of software designers and developers to the usage of graph grammars and graph rewrite systems. Two of the main problems are, (1) that current graph grammar notations are too propri...
متن کاملInstance-Aware Model Checking of Graph Transformation Systems using Henshin and mCRL2
Network topologies in distributed and mobile systems can be naturally described using graph-based models. Specifying configurations of such systems is realized by assigning nodes modeling entities in the network to logical locations in the graph. The operational semantics of such models can be formally described using graph transformation systems by modeling the interactive behavior of the enti...
متن کاملApplications and Rewriting of Omnigraphs - Exemplified in the Domain of MDD
Graph rewrite systems provide only elementary primitives – many applications require more complex structures though. We present a rewrite system for omnigraphs, a formal extension of hypergraphs with the ability to connect multiple nodes and edges with a single edge. We exemplify the adequacy of this approach in the domain of Model Driven Development (MDD): Using our system trivializes the repr...
متن کاملThe Graph Grammar Library - A Generic Framework for Chemical Graph Rewrite Systems
Graph rewrite systems are powerful tools to model and study complex problems in various fields of research. Their successful application to chemical reaction modelling on a molecular level was shown but no appropriate and simple system is available at the moment. The presented Graph Grammar Library (GGL) implements a generic Double Push Out approach for general graph rewrite systems. The framew...
متن کاملParameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015