Graphs for Core Molecular Biology
نویسندگان
چکیده
A graphic language—the graphic κ calculus—modeling protein interactions at the domain level is introduced. Complexation, activation and mixed forms of interaction are expressed as graph rewriting rules. A compilation in a low-level graph rewriting calculus, called mobile κ, is given and shown to be correct up to some suitable notion of observational equivalence. This intermediate language is of independent interest and can be easily implemented in π-like calculi.
منابع مشابه
A generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملBioinformatics Designing of 10-23 Deoxyribozyme against Coding Region of Beta-galactosidase Gene
Background: Deoxyribozymes (Dzs) can play a role as gene expression inhibitors at mRNA level. Among Dzs, the 10-23 deoxyribozyme has significant potentials for treatment of diseases. Designed Dz includes a catalytic core made of 15 deoxyribonucleotides and two binding arms consisted of 6-12 nucleotides for site specific binding to target RNA and hydrolysis. The enzyme has characteristic feature...
متن کاملEccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کاملGraphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملSLC2A4 Polymorphisms Can Be a New Molecular Biomarker for Sports Genomics
"SLC2A4 Polymorphisms Can Be a New Molecular Biomarker for Sports Genomics" is an "Editorial Article" and hasn't abstract.
متن کاملCoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms
How do the k-core structures of real-world graphs look like? What are the common patterns and the anomalies? How can we use them for algorithm design and applications? A k-core is the maximal subgraph where all vertices have degree at least k. This concept has been applied to such diverse areas as hierarchical structure analysis, graph visualization, and graph clustering. Here, we explore perva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003