Domination criticality in product graphs

Directory of Open Access Journals (Sweden)

M.R. Chithra

2015-07-01

Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.

Tetravalent one-regular graphs of order 4p2

DEFF Research Database (Denmark)

Feng, Yan-Quan; Kutnar, Klavdija; Marusic, Dragan

2014-01-01

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper tetravalent one-regular graphs of order 4p2, where p is a prime, are classified.......A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper tetravalent one-regular graphs of order 4p2, where p is a prime, are classified....

Application of Bipolar Fuzzy Sets in Graph Structures

Directory of Open Access Journals (Sweden)

Muhammad Akram

2016-01-01

Full Text Available A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we apply the concept of bipolar fuzzy sets to graph structures. We introduce certain notions, including bipolar fuzzy graph structure (BFGS, strong bipolar fuzzy graph structure, bipolar fuzzy Ni-cycle, bipolar fuzzy Ni-tree, bipolar fuzzy Ni-cut vertex, and bipolar fuzzy Ni-bridge, and illustrate these notions by several examples. We study ϕ-complement, self-complement, strong self-complement, and totally strong self-complement in bipolar fuzzy graph structures, and we investigate some of their interesting properties.

Hybrid DNA i-motif: Aminoethylprolyl-PNA (pC5) enhance the stability of DNA (dC5) i-motif structure.

Science.gov (United States)

Gade, Chandrasekhar Reddy; Sharma, Nagendra K

2017-12-15

This report describes the synthesis of C-rich sequence, cytosine pentamer, of aep-PNA and its biophysical studies for the formation of hybrid DNA:aep-PNAi-motif structure with DNA cytosine pentamer (dC 5 ) under acidic pH conditions. Herein, the CD/UV/NMR/ESI-Mass studies strongly support the formation of stable hybrid DNA i-motif structure with aep-PNA even near acidic conditions. Hence aep-PNA C-rich sequence cytosine could be considered as potential DNA i-motif stabilizing agents in vivo conditions. Copyright © 2017 Elsevier Ltd. All rights reserved.

1,1-Dimethylbiguanidium(2+ dinitrate

Directory of Open Access Journals (Sweden)

Michaela Fridrichová

2012-01-01

Full Text Available In the crystal structure of the title compound, C4H13N52+·2NO3−, the main intermolecular interactions are the N—H...O hydrogen bonds between the cationic amino groups and the O atoms of the nitrate ions. All amino H atoms and nitrate O atoms are involved in the three-dimensional hydrogen-bond network. There are two graph-set motifs R22(8, which include the amino groups connected to the N atoms in the biguanide 3-, 4- and 5-positions, and the O atoms of a nitrate ion. They are extended along the a axis. An O atom of the second nitrate ion is involved in a graph-set motif C(4 that is a part of a helix-like N—H...O...H—N—H...O... chain oriented along the b axis. There are also two weak C—H...O interactions in the crystal structure.

Identification of group specific motifs in Beta-lactamase family of proteins

Directory of Open Access Journals (Sweden)

Saxena Akansha

2009-12-01

Full Text Available Abstract Background Beta-lactamases are one of the most serious threats to public health. In order to combat this threat we need to study the molecular and functional diversity of these enzymes and identify signatures specific to these enzymes. These signatures will enable us to develop inhibitors and diagnostic probes specific to lactamases. The existing classification of beta-lactamases was developed nearly 30 years ago when few lactamases were available. DLact database contain more than 2000 beta-lactamase, which can be used to study the molecular diversity and to identify signatures specific to this family. Methods A set of 2020 beta-lactamase proteins available in the DLact database http://59.160.102.202/DLact were classified using graph-based clustering of Best Bi-Directional Hits. Non-redundant (> 90 percent identical protein sequences from each group were aligned using T-Coffee and annotated using information available in literature. Motifs specific to each group were predicted using PRATT program. Results The graph-based classification of beta-lactamase proteins resulted in the formation of six groups (Four major groups containing 191, 726, 774 and 73 proteins while two minor groups containing 50 and 8 proteins. Based on the information available in literature, we found that each of the four major groups correspond to the four classes proposed by Ambler. The two minor groups were novel and do not contain molecular signatures of beta-lactamase proteins reported in literature. The group-specific motifs showed high sensitivity (> 70% and very high specificity (> 90%. The motifs from three groups (corresponding to class A, C and D had a high level of conservation at DNA as well as protein level whereas the motifs from the fourth group (corresponding to class B showed conservation at only protein level. Conclusion The graph-based classification of beta-lactamase proteins corresponds with the classification proposed by Ambler, thus there is

Generalized hypercube graph $\\Q_n(S$, graph products and self-orthogonal codes

Directory of Open Access Journals (Sweden)

Pani Seneviratne

2016-01-01

Full Text Available A generalized hypercube graph $\\Q_n(S$ has $\\F_{2}^{n}=\\{0,1\\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \\ge 1$ and $S\\subseteq \\{1,2,\\ldots, n\\}$. The graph $\\Q_n(\\{1\\}$ is the $n$-cube, usually denoted by $\\Q_n$.We study graph boolean products $G_1 = \\Q_n(S\\times \\Q_1, G_2 = \\Q_{n}(S\\wedge \\Q_1$, $G_3 = \\Q_{n}(S[\\Q_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

Graph Theory. 2. Vertex Descriptors and Graph Coloring

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

Dimethyl 4,4′-dihydroxy-3,3′-{[(3aRS,7aRS-2,3,3a,4,5,6,7,7a-octahydro-1H-1,3-benzimidazole-1,3-diyl]bis(methylene}dibenzoate

Directory of Open Access Journals (Sweden)

Augusto Rivera

2011-11-01

Full Text Available The title compound, C25H30N2O6, has the imidazolidine ring in an envelope conformation. There are two intramolecular O—H...N hydrogen-bond interactions with graph-set motif S(6. The cyclohexane ring adopts a slightly distorted chair conformation. One methyl carboxylate substituent forms a dihedral angle of 12.00 (5° with the plane of the benzene ring, while the other methyl carboxylate group is almost coplanar, making a dihedral angle of 2.26 (9°. In the crystal, pairs of intermolecular C—H...O hydrogen bonds form racemic dimers, corresponding to an R22(18 graph-set motif. Further weak C—H...O interactions generate a chain running along the c axis.

Distance 2-Domination in Prisms of Graphs

Directory of Open Access Journals (Sweden)

Hurtado Ferran

2017-05-01

Full Text Available A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G − D and D is at most two. Let γ2(G denote the size of a smallest distance 2-dominating set of G. For any permutation π of the vertex set of G, the prism of G with respect to π is the graph πG obtained from G and a copy G′ of G by joining u ∊ V(G with v′ ∊ V(G′ if and only if v′ = π(u. If γ2(πG = γ2(G for any permutation π of V(G, then G is called a universal γ2-fixer. In this work we characterize the cycles and paths that are universal γ2-fixers.

Chromatically unique 6-bridge graph theta(a,a,a,b,b,c

Directory of Open Access Journals (Sweden)

N.S.A. Karim

2016-04-01

Full Text Available For a graph $G$, let $P(G,\\lambda$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if for any graph chromatically equivalent to $G$ is isomorphic to $G$. In this paper, the chromatically unique of a new family of 6-bridge graph $\\theta(a,a,a,b,b,c$ where $2\\le a\\le b\\le c$ is investigated.

A Maximum Resonant Set of Polyomino Graphs

Directory of Open Access Journals (Sweden)

Zhang Heping

2016-05-01

Full Text Available A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. A dimer covering of P corresponds to a perfect matching. Different dimer coverings can interact via an alternating cycle (or square with respect to them. A set of disjoint squares of P is a resonant set if P has a perfect matching M so that each one of those squares is M-alternating. In this paper, we show that if K is a maximum resonant set of P, then P − K has a unique perfect matching. We further prove that the maximum forcing number of a polyomino graph is equal to the cardinality of a maximum resonant set. This confirms a conjecture of Xu et al. [26]. We also show that if K is a maximal alternating set of P, then P − K has a unique perfect matching.

Outer-2-independent domination in graphs

Indian Academy of Sciences (India)

independent dominating set of a graph is a set of vertices of such that every vertex of ()\\ has a neighbor in and the maximum vertex degree of the subgraph induced by ()\\ is at most one. The outer-2-independent domination ...

A novel k-mer set memory (KSM) motif representation improves regulatory variant prediction.

Science.gov (United States)

Guo, Yuchun; Tian, Kevin; Zeng, Haoyang; Guo, Xiaoyun; Gifford, David Kenneth

2018-04-13

The representation and discovery of transcription factor (TF) sequence binding specificities is critical for understanding gene regulatory networks and interpreting the impact of disease-associated noncoding genetic variants. We present a novel TF binding motif representation, the k -mer set memory (KSM), which consists of a set of aligned k -mers that are overrepresented at TF binding sites, and a new method called KMAC for de novo discovery of KSMs. We find that KSMs more accurately predict in vivo binding sites than position weight matrix (PWM) models and other more complex motif models across a large set of ChIP-seq experiments. Furthermore, KSMs outperform PWMs and more complex motif models in predicting in vitro binding sites. KMAC also identifies correct motifs in more experiments than five state-of-the-art motif discovery methods. In addition, KSM-derived features outperform both PWM and deep learning model derived sequence features in predicting differential regulatory activities of expression quantitative trait loci (eQTL) alleles. Finally, we have applied KMAC to 1600 ENCODE TF ChIP-seq data sets and created a public resource of KSM and PWM motifs. We expect that the KSM representation and KMAC method will be valuable in characterizing TF binding specificities and in interpreting the effects of noncoding genetic variations. © 2018 Guo et al.; Published by Cold Spring Harbor Laboratory Press.

4,4-Dimethyl-3,4-dihydropyrido[2′,3′:3,4]pyrazolo[1,5-a][1,3,5]triazin-2-amine ethanol monosolvateFused heterocyclic systems with s-triazine ring. Part 16. for part 15, see Sachdeva et al. (2010.

Directory of Open Access Journals (Sweden)

Lip Lin Koh

2011-01-01

Full Text Available In the title compound, C10H12N6·C2H5OH, the planarity of the heterocyclic system is slightly distorted at the triazine ring (r.m.s. deviation = 0.1191 Å, which adopts a conformation best described as intermediate between a flattened twisted boat and a half-boat with the tertiary Csp3 atom at the bow. In the crystal, molecules form centrosymmetric dimers connected by N...H—O and O...H—N hydrogen bonds between the amino group H atom, the ethanol solvent molecule and the triazine N atom, making an R44(12 graph-set motif. The other H atom of the amino group and the H atom on the endocyclic N atom form N...H—N hydrogen bonds with the N atoms of the pyrazole and pyridine rings, respectively, linking the molecules into C(7C(7 chains with the R22(8 binary graph-set motif running along [010].

Reconfiguring Independent Sets in Claw-Free Graphs

NARCIS (Netherlands)

Bonsma, P.S.; Kamiński, Marcin; Wrochna, Marcin; Ravi, R.; Gørtz, Inge Li

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph G, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex v from the current independent set S and to add a new vertex w (not in

The structural study of [2-Cl-C.sub.6./sub.H.sub.4./sub.C(O)NH]P(O)[NHC.sub.6./sub.H.sub.4./sub.-4-CH.sub.3./sub.].sub.2./sub.

Czech Academy of Sciences Publication Activity Database

Taherzadeh, M.; Pourayoubi, M.; Dušek, Michal; Kučeráková, Monika

2016-01-01

Roč. 2, č. 12 (2016), s. 1-5 ISSN 2470-9905 R&D Projects: GA MŠk LO1603; GA ČR GA15-12719S EU Projects: European Commission(XE) CZ.2.16/3.1.00/24510 Institutional support: RVO:68378271 Keywords : phosphoric triamide * hydrogen bond * crystal structure * graph set motif Subject RIV: BM - Solid Matter Physics ; Magnetism OBOR OECD: Condensed matter physics (including formerly solid state physics, supercond.)

Binding of the cSH3 domain of Grb2 adaptor to two distinct RXXK motifs within Gab1 docker employs differential mechanisms.

Science.gov (United States)

McDonald, Caleb B; Seldeen, Kenneth L; Deegan, Brian J; Bhat, Vikas; Farooq, Amjad

2011-01-01

A ubiquitous component of cellular signaling machinery, Gab1 docker plays a pivotal role in routing extracellular information in the form of growth factors and cytokines to downstream targets such as transcription factors within the nucleus. Here, using isothermal titration calorimetry (ITC) in combination with macromolecular modeling (MM), we show that although Gab1 contains four distinct RXXK motifs, designated G1, G2, G3, and G4, only G1 and G2 motifs bind to the cSH3 domain of Grb2 adaptor and do so with distinct mechanisms. Thus, while the G1 motif strictly requires the PPRPPKP consensus sequence for high-affinity binding to the cSH3 domain, the G2 motif displays preference for the PXVXRXLKPXR consensus. Such sequential differences in the binding of G1 and G2 motifs arise from their ability to adopt distinct polyproline type II (PPII)- and 3(10) -helical conformations upon binding to the cSH3 domain, respectively. Collectively, our study provides detailed biophysical insights into a key protein-protein interaction involved in a diverse array of signaling cascades central to health and disease. Copyright © 2010 John Wiley & Sons, Ltd.

L(2,1)-labelling of Circular-arc Graph

OpenAIRE

Paul, Satyabrata; Pal, Madhumangal; Pal, Anita

2014-01-01

An L(2,1)-labelling of a graph $G=(V, E)$ is $\\lambda_{2,1}(G)$ a function $f$ from the vertex set V (G) to the set of non-negative integers such that adjacent vertices get numbers at least two apart, and vertices at distance two get distinct numbers. The L(2,1)-labelling number denoted by $\\lambda_{2,1}(G)$ of $G$ is the minimum range of labels over all such labelling. In this article, it is shown that, for a circular-arc graph $G$, the upper bound of $\\lambda_{2,1}(G)$ is $\\Delta+3\\omega$, ...

MotifMark: Finding regulatory motifs in DNA sequences.

Science.gov (United States)

Hassanzadeh, Hamid Reza; Kolhe, Pushkar; Isbell, Charles L; Wang, May D

2017-07-01

The interaction between proteins and DNA is a key driving force in a significant number of biological processes such as transcriptional regulation, repair, recombination, splicing, and DNA modification. The identification of DNA-binding sites and the specificity of target proteins in binding to these regions are two important steps in understanding the mechanisms of these biological activities. A number of high-throughput technologies have recently emerged that try to quantify the affinity between proteins and DNA motifs. Despite their success, these technologies have their own limitations and fall short in precise characterization of motifs, and as a result, require further downstream analysis to extract useful and interpretable information from a haystack of noisy and inaccurate data. Here we propose MotifMark, a new algorithm based on graph theory and machine learning, that can find binding sites on candidate probes and rank their specificity in regard to the underlying transcription factor. We developed a pipeline to analyze experimental data derived from compact universal protein binding microarrays and benchmarked it against two of the most accurate motif search methods. Our results indicate that MotifMark can be a viable alternative technique for prediction of motif from protein binding microarrays and possibly other related high-throughput techniques.

Total Domination Versus Paired-Domination in Regular Graphs

Directory of Open Access Journals (Sweden)

Cyman Joanna

2018-05-01

Full Text Available A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G, is the minimum cardinality of a dominating set of G, while the minimum cardinalities of a total dominating set and paired-dominating set are the total domination number, γt(G, and the paired-domination number, γpr(G, respectively. For k ≥ 2, let G be a connected k-regular graph. It is known [Schaudt, Total domination versus paired domination, Discuss. Math. Graph Theory 32 (2012 435–447] that γpr(G/γt(G ≤ (2k/(k+1. In the special case when k = 2, we observe that γpr(G/γt(G ≤ 4/3, with equality if and only if G ≅ C5. When k = 3, we show that γpr(G/γt(G ≤ 3/2, with equality if and only if G is the Petersen graph. More generally for k ≥ 2, if G has girth at least 5 and satisfies γpr(G/γt(G = (2k/(k + 1, then we show that G is a diameter-2 Moore graph. As a consequence of this result, we prove that for k ≥ 2 and k ≠ 57, if G has girth at least 5, then γpr(G/γt(G ≤ (2k/(k +1, with equality if and only if k = 2 and G ≅ C5 or k = 3 and G is the Petersen graph.

Bounds on the 2-domination number in cactus graphs

Directory of Open Access Journals (Sweden)

Mustapha Chellali

2006-01-01

Full Text Available A \\(2\\-dominating set of a graph \\(G\\ is a set \\(D\\ of vertices of \\(G\\ such that every vertex not in \\(S\\ is dominated at least twice. The minimum cardinality of a \\(2\\-dominating set of \\(G\\ is the \\(2\\-domination number \\(\\gamma_{2}(G\\. We show that if \\(G\\ is a nontrivial connected cactus graph with \\(k(G\\ even cycles (\\(k(G\\geq 0\\, then \\(\\gamma_{2}(G\\geq\\gamma_{t}(G-k(G\\, and if \\(G\\ is a graph of order \\(n\\ with at most one cycle, then \\(\\gamma_{2}(G\\geqslant(n+\\ell-s/2\\ improving Fink and Jacobson's lower bound for trees with \\(\\ell>s\\, where \\(\\gamma_{t}(G\\, \\(\\ell\\ and \\(s\\ are the total domination number, the number of leaves and support vertices of \\(G\\, respectively. We also show that if \\(T\\ is a tree of order \\(n\\geqslant 3\\, then \\(\\gamma_{2}(T\\leqslant\\beta(T+s-1\\, where \\(\\beta(T\\ is the independence number of \\(T\\.

Characterizing graphs of maximum matching width at most 2

DEFF Research Database (Denmark)

Jeong, Jisu; Ok, Seongmin; Suh, Geewon

2017-01-01

The maximum matching width is a width-parameter that is de ned on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize the graphs of maximum matching width at most 2 using the minor o...

The partition dimension of cycle books graph

Science.gov (United States)

Santoso, Jaya; Darmaji

2018-03-01

Let G be a nontrivial and connected graph with vertex set V(G), edge set E(G) and S ⊆ V(G) with v ∈ V(G), the distance between v and S is d(v,S) = min{d(v,x)|x ∈ S}. For an ordered partition ∏ = {S 1, S 2, S 3,…, Sk } of V(G), the representation of v with respect to ∏ is defined by r(v|∏) = (d(v, S 1), d(v, S 2),…, d(v, Sk )). The partition ∏ is called a resolving partition of G if all representations of vertices are distinct. The partition dimension pd(G) is the smallest integer k such that G has a resolving partition set with k members. In this research, we will determine the partition dimension of Cycle Books {B}{Cr,m}. Cycle books graph {B}{Cr,m} is a graph consisting of m copies cycle Cr with the common path P 2. It is shown that the partition dimension of cycle books graph, pd({B}{C3,m}) is 3 for m = 2, 3, and m for m ≥ 4. pd({B}{C4,m}) is 3 + 2k for m = 3k + 2, 4 + 2(k ‑ 1) for m = 3k + 1, and 3 + 2(k ‑ 1) for m = 3k. pd({B}{C5,m}) is m + 1.

CombiMotif: A new algorithm for network motifs discovery in protein-protein interaction networks

Science.gov (United States)

Luo, Jiawei; Li, Guanghui; Song, Dan; Liang, Cheng

2014-12-01

Discovering motifs in protein-protein interaction networks is becoming a current major challenge in computational biology, since the distribution of the number of network motifs can reveal significant systemic differences among species. However, this task can be computationally expensive because of the involvement of graph isomorphic detection. In this paper, we present a new algorithm (CombiMotif) that incorporates combinatorial techniques to count non-induced occurrences of subgraph topologies in the form of trees. The efficiency of our algorithm is demonstrated by comparing the obtained results with the current state-of-the art subgraph counting algorithms. We also show major differences between unicellular and multicellular organisms. The datasets and source code of CombiMotif are freely available upon request.

2-Methyl-1H-benzimidazol-3-ium hydrogen phthalate

Directory of Open Access Journals (Sweden)

YuanQi Yu

2011-10-01

Full Text Available The asymmetric unit of the title compound, C8H9N2+·C8H5O4−, contains two independent ion pairs. In each 2-methyl-1H-benzimidazolium ion, an intramolecular O—H...O bond forms an S(7 graph-set motif. In the crystal, the components are linked by N—H...O hydrogen bonds, forming chains along [210]. Further stabilization is provided by weak C—H...O hydrogen bonds.

Text categorization of biomedical data sets using graph kernels and a controlled vocabulary.

Science.gov (United States)

Bleik, Said; Mishra, Meenakshi; Huan, Jun; Song, Min

2013-01-01

Recently, graph representations of text have been showing improved performance over conventional bag-of-words representations in text categorization applications. In this paper, we present a graph-based representation for biomedical articles and use graph kernels to classify those articles into high-level categories. In our representation, common biomedical concepts and semantic relationships are identified with the help of an existing ontology and are used to build a rich graph structure that provides a consistent feature set and preserves additional semantic information that could improve a classifier's performance. We attempt to classify the graphs using both a set-based graph kernel that is capable of dealing with the disconnected nature of the graphs and a simple linear kernel. Finally, we report the results comparing the classification performance of the kernel classifiers to common text-based classifiers.

Novel multiple criteria decision making methods based on bipolar neutrosophic sets and bipolar neutrosophic graphs

OpenAIRE

Muhammad, Akram; Musavarah, Sarwar

2016-01-01

In this research study, we introduce the concept of bipolar neutrosophic graphs. We present the dominating and independent sets of bipolar neutrosophic graphs. We describe novel multiple criteria decision making methods based on bipolar neutrosophic sets and bipolar neutrosophic graphs. We also develop an algorithm for computing domination in bipolar neutrosophic graphs.

(3Z-5-Chloro-3-(hydroxyiminoindolin-2-one

Directory of Open Access Journals (Sweden)

Bianca Barreto Martins

2016-10-01

Full Text Available In the title compound, C8H5ClN2O2 (common name: 5-chloroisatin 3-oxime, the molecular structure deviates slightly from the ideal planarity, with a maximum deviation of 0.0478 (8 Å for the non-H atoms. In the crystal, molecules are linked by N—H...O interactions, building centrosymmetric dimers with graph-set motif R22(8. Additionally, the molecules are connected by pairs of O—H...O interactions into chains along [100] with a C(6 motif. The hydrogen-bonded dimers and chains build a two-dimensional network parallel to (100. The packing also features π–π stacking interactions between benzene rings [centroid–centroid distance = 3.748 (2 Å].

Maximal independent set graph partitions for representations of body-centered cubic lattices

DEFF Research Database (Denmark)

Erleben, Kenny

2009-01-01

corresponding to the leaves of a quad-tree thus has a smaller memory foot-print. The adjacency information in the graph relieves one from going up and down the quad-tree when searching for neighbors. This results in constant time complexities for refinement and coarsening operations.......A maximal independent set graph data structure for a body-centered cubic lattice is presented. Refinement and coarsening operations are defined in terms of set-operations resulting in robust and easy implementation compared to a quad-tree-based implementation. The graph only stores information...

Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

NARCIS (Netherlands)

Monshizadeh Naini, Nima; Zhang, Shuo; Camlibel, M. Kanat

In this technical note, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network

C7-Decompositions of the Tensor Product of Complete Graphs

Directory of Open Access Journals (Sweden)

Manikandan R.S.

2017-08-01

Full Text Available In this paper we consider a decomposition of Km × Kn, where × denotes the tensor product of graphs, into cycles of length seven. We prove that for m, n ≥ 3, cycles of length seven decompose the graph Km × Kn if and only if (1 either m or n is odd and (2 14 | m(m − 1n(n − 1. The results of this paper together with the results of [Cp-Decompositions of some regular graphs, Discrete Math. 306 (2006 429–451] and [C5-Decompositions of the tensor product of complete graphs, Australasian J. Combinatorics 37 (2007 285–293], give necessary and sufficient conditions for the existence of a p-cycle decomposition, where p ≥ 5 is a prime number, of the graph Km × Kn.

C-Aryl glucoside SGLT2 inhibitors containing a biphenyl motif as potential anti-diabetic agents.

Science.gov (United States)

Ding, Yuyang; Mao, Liufeng; Xu, Dengfeng; Xie, Hui; Yang, Ling; Xu, Hongjiang; Geng, Wenjun; Gao, Yong; Xia, Chunguang; Zhang, Xiquan; Meng, Qingyi; Wu, Donghai; Zhao, Junling; Hu, Wenhui

2015-07-15

A series of highly active C-aryl glucoside SGLT2 inhibitors containing a biphenyl motif were designed and synthesized for biological evaluation. Among the compounds tested, compound 16l demonstrated high inhibitory activity against SGLT2 (IC50=1.9 nM) with an excellent pharmacokinetic profile. Further study indicated that the in vivo efficacy of compound 16l was comparable to that of dapagliflozin, suggesting that further development would be worthwhile. Copyright © 2015 Elsevier Ltd. All rights reserved.

Temporal motifs in time-dependent networks

International Nuclear Information System (INIS)

Kovanen, Lauri; Karsai, Márton; Kaski, Kimmo; Kertész, János; Saramäki, Jari

2011-01-01

Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as telecommunication, neural signal processing, biochemical reaction and human social interaction networks. We introduce the framework of temporal motifs to study the mesoscale topological–temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to coloured directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network

Two-setting Bell inequalities for graph states

International Nuclear Information System (INIS)

Toth, Geza; Guehne, Otfried; Briegel, Hans J.

2006-01-01

We present Bell inequalities for graph states with a high violation of local realism. In particular, we show that there is a basic Bell inequality for every nontrivial graph state which is violated by the state at least by a factor of 2. This inequality needs the measurement of, at most, two operators for each qubit and involves only some of the qubits. We also show that for some families of graph states composite Bell inequalities can be constructed such that the violation of local realism increases exponentially with the number of qubits. We prove that some of our inequalities are facets of the convex polytope containing the many-body correlations consistent with local hidden variable models. Our Bell inequalities are built from stabilizing operators of graph states

On Graph C*-Algebras with a Linear Ideal Lattice

DEFF Research Database (Denmark)

Eilers, Søren; Restorff, Gunnar; Ruiz, Efren

2010-01-01

At the cost of restricting the nature of the involved K-groups, we prove a classication result for a hitherto unexplored class of graph C-algebras, allowing us to classify all graph C-algebras on nitely many vertices with a nite linear ideal lattice if all pair of vertices are connected by innitely...

(E-2-(4-Chlorophenoxy-N′-(pyridin-4-ylmethylideneacetohydrazide

Directory of Open Access Journals (Sweden)

Xiao-jin Rao

2013-01-01

Full Text Available In the title compound, C14H12ClN3O2, the acylhydrazone base [C(=O—N—N=C] is essentially planar, with an r.m.s. deviation of 0.0095 Å, and makes a dihedral angle of 12.52 (10°with the pyridine ring. In the crystal, molecules are linked via pairs of N—H...O hydrogen bonds, forming inversion dimers with an R22(8 graph-set motif. The dimers are linked via C—H...π interactions forming chains along [101].

5-Imino-3,4-diphenyl-1H-pyrrol-2-one

Science.gov (United States)

Bulatov, Evgeny; Chulkova, Tatiana; Haukka, Matti

2014-01-01

The title compound, C16H12N2O, exists in the crystalline state as the 5-imino-3,4-di­phenyl­-1H-pyrrol-2-one tautomer. The dihedral angles between the pyrrole and phenyl rings are 35.3 (2) and 55.3 (2)°. In the crystal, inversion dimers linked by pairs of N—H⋯N hydrogen bonds generate a graph-set motif of R 2 2(8) via N—H⋯N hydrogen bonds. PMID:24764881

(meso-5,7,7,12,14,14-Hexamethyl-1,4,8,11-tetraazacyclotetradeca-4,11-dienenickel(II dibromide dihydrate

Directory of Open Access Journals (Sweden)

Yonghong Lu

2010-10-01

Full Text Available The asymmetric unit of the title compound, [Ni(C16H32N4]Br2·2H2O, consists of one half [Ni(C16H32N4]2+ cation, one Br− anion and one water molecule of crystallization. The NiII ion lies on an inversion centre in a square-planar environment formed by the four macrocyclic ligand N atoms. In the crystal structure, the cations, anions and water molecules are linked via intermolecular N—H...Br and O—H...Br hydrogen bonds, forming discrete chains with set-graph motif D(2D22(7D21(3D32(8. The water molecules and Br− ions are linked with set-graph motif R42(8.

5-Imino-3,4-diphenyl-1H-pyrrol-2-one

Directory of Open Access Journals (Sweden)

Evgeny Bulatov

2014-02-01

Full Text Available The title compound, C16H12N2O, exists in the crystalline state as the 5-imino-3,4-diphenyl-1H-pyrrol-2-one tautomer. The dihedral angles between the pyrrole and phenyl rings are 35.3 (2 and 55.3 (2°. In the crystal, inversion dimers linked by pairs of N—H...N hydrogen bonds generate a graph-set motif of R22(8 via N—H...N hydrogen bonds.

CompariMotif: quick and easy comparisons of sequence motifs.

Science.gov (United States)

Edwards, Richard J; Davey, Norman E; Shields, Denis C

2008-05-15

CompariMotif is a novel tool for making motif-motif comparisons, identifying and describing similarities between regular expression motifs. CompariMotif can identify a number of different relationships between motifs, including exact matches, variants of degenerate motifs and complex overlapping motifs. Motif relationships are scored using shared information content, allowing the best matches to be easily identified in large comparisons. Many input and search options are available, enabling a list of motifs to be compared to itself (to identify recurring motifs) or to datasets of known motifs. CompariMotif can be run online at http://bioware.ucd.ie/ and is freely available for academic use as a set of open source Python modules under a GNU General Public License from http://bioinformatics.ucd.ie/shields/software/comparimotif/

The $K$-theory of real graph $C*$-algebras

OpenAIRE

Boersema, Jeffrey L.

2014-01-01

In this paper, we will introduce real graph algebras and develop the theory to the point of being able to calculate the $K$-theory of such algebras. The $K$-theory situation is significantly more complicated than in the case for complex graph algebras. To develop the long exact sequence to compute the $K$-theory of a real graph algebra, we need to develop a generalized theory of crossed products for real C*-algebras for groups with involution. We also need to deal with the additional algebrai...

On middle cube graphs

Directory of Open Access Journals (Sweden)

C. Dalfo

2015-10-01

Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

NARCIS (Netherlands)

Bauer, D.; Broersma, Haitze J.; Kahl, N.; Morgana, A.; Schmeichel, E.; Surowiec, T.

2007-01-01

A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph $G$ in terms of what is usually called the deficiency. A subset $X$ of $V(G)$ for which this deficiency is attained is called a Tutte set of $G$. While much is known about maximum matchings, less is known

Introduction to graph theory

CERN Document Server

Trudeau, Richard J

1994-01-01

Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

Targeting chemokine (C-C motif) ligand 2 (CCL2) as an example of translation of cancer molecular biology to the clinic.

Science.gov (United States)

Zhang, Jian; Patel, Lalit; Pienta, Kenneth J

2010-01-01

Chemokines are a family of small and secreted proteins that play pleiotropic roles in inflammation-related pathological diseases, including cancer. Among the identified 50 human chemokines, chemokine (C-C motif) ligand 2 (CCL2) is of particular importance in cancer development since it serves as one of the key mediators of interactions between tumor and host cells. CCL2 is produced by cancer cells and multiple different host cells within the tumor microenvironment. CCL2 mediates tumorigenesis in many different cancer types. For example, CCL2 has been reported to promote prostate cancer cell proliferation, migration, invasion, and survival, via binding to its functional receptor CCR2. Furthermore, CCL2 induces the recruitment of macrophages and induces angiogenesis and matrix remodeling. Targeting CCL2 has been demonstrated as an effective therapeutic approach in preclinical prostate cancer models, and currently, neutralizing monoclonal antibody against CCL2 has entered into clinical trials in prostate cancer. In this chapter, targeting CCL2 in prostate cancer will be used as an example to show translation of laboratory findings from cancer molecular biology to the clinic. Copyright © 2010 Elsevier Inc. All rights reserved.

2-(4-Methylphenyl-7-(2-methylpropoxy-4H-chromen-4-one–6-chloro-2-(4-methylphenyl-7-(2-methylpropoxy-4H-chromen-4-one (19/1

Directory of Open Access Journals (Sweden)

Vijay M. Barot

2012-08-01

Full Text Available The title co-crystal, 0.95C20H20O3·0.05C20H19ClO3, arises as the chloride carried over during the synthesis shares a position with an aromatic H atom; the partial occupancies are 0.947 (2 and 0.053 (2 for H and Cl, respectively. The molecular structure is stabilized by intramolecular C—H...O contacts, forming pseudo five- and six-membered rings with S(5 and S(6 graph-set motifs, respectively. The crystal structure features π–π stacking interactions between the centroids of the central fused ring systems [centroid–centroid distance = 3.501 (2 Å].

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

DEFF Research Database (Denmark)

Bensmail, Julien; Renault, Gabriel

2016-01-01

An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

Directory of Open Access Journals (Sweden)

Namhee Kim

Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs

Recognition of the group G2(5 by the prime graph

Directory of Open Access Journals (Sweden)

Parivash Nosratpour

2014-05-01

Full Text Available Let $G$ be a finite group‎. ‎The prime graph of $G$‎ ‎is a graph $\\Gamma(G$ with vertex set $\\pi(G$‎, ‎the set of all‎ ‎prime divisors of $|G|$‎, ‎and two distinct vertices $p$ and $q$ are‎ ‎adjacent by an edge if $G$ has an element of order $pq$‎. ‎In this‎ ‎paper we prove that if $\\Gamma(G=\\Gamma(G_2(5$‎, ‎then $G$ has a‎ ‎normal subgroup $N$ such that $\\pi(N\\subseteq\\{2,3,5\\}$ and‎ ‎$G/N\\cong G_2(5$‎.

Path covering number and L(2,1)-labeling number of graphs

OpenAIRE

Lu, Changhong; Zhou, Qing

2012-01-01

A {\\it path covering} of a graph $G$ is a set of vertex disjoint paths of $G$ containing all the vertices of $G$. The {\\it path covering number} of $G$, denoted by $P(G)$, is the minimum number of paths in a path covering of $G$. An {\\sl $k$-L(2,1)-labeling} of a graph $G$ is a mapping $f$ from $V(G)$ to the set ${0,1,...,k}$ such that $|f(u)-f(v)|\\ge 2$ if $d_G(u,v)=1$ and $|f(u)-f(v)|\\ge 1$ if $d_G(u,v)=2$. The {\\sl L(2,1)-labeling number $\\lambda (G)$} of $G$ is the smallest number $k$ suc...

Declarative Process Mining for DCR Graphs

DEFF Research Database (Denmark)

Debois, Søren; Hildebrandt, Thomas T.; Laursen, Paw Høvsgaard

2017-01-01

We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison...

Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders

Directory of Open Access Journals (Sweden)

Salah Al-Addasi

2008-01-01

in which this upper bound is attained, this graph can be viewed as a generalization of the Rhombic Dodecahedron. Then we show that for any ≥2, the graph (2,2 is the unique (up to isomorphism bipartite diametrical graph of diameter 4 and partite sets of cardinalities 2 and 2, and hence in particular, for =3, the graph (6,8 which is just the Rhombic Dodecahedron is the unique (up to isomorphism bipartite diametrical graph of such a diameter and cardinalities of partite sets. Thus we complete a characterization of -graphs of diameter 4 and cardinality of the smaller partite set not exceeding 6. We prove that the neighborhoods of vertices of the larger partite set of (2,2 form a matroid whose basis graph is the hypercube . We prove that any -graph of diameter 4 is bipartite self complementary, thus in particular (2,2. Finally, we study some additional properties of (2,2 concerning the order of its automorphism group, girth, domination number, and when being Eulerian.

2-[(E-(2S,5R-2-Isopropyl-5-methylcyclohexylidene]-N-methylhydrazine-1-carbothioamide

Directory of Open Access Journals (Sweden)

Adriano Bof de Oliveira

2016-03-01

Full Text Available There are two molecules in the asymmetric unit of the title compound, C12H23N3S, which are linked by two strong N—H...S hydrogen bonds, building a non-centrosymmetric dimer with graph-set motif R22(8. The molecules are further connected by N—H...S interactions into a two-dimensional hydrogen-bonded polymeric structure along the [001] direction. The absolute structure is based on the refinement of the Flack parameter.

Interaction of Cu(+) with cytosine and formation of i-motif-like C-M(+)-C complexes: alkali versus coinage metals.

Science.gov (United States)

Gao, Juehan; Berden, Giel; Rodgers, M T; Oomens, Jos

2016-03-14

The Watson-Crick structure of DNA is among the most well-known molecular structures of our time. However, alternative base-pairing motifs are also known to occur, often depending on base sequence, pH, or the presence of cations. Pairing of cytosine (C) bases induced by the sharing of a single proton (C-H(+)-C) may give rise to the so-called i-motif, which occurs primarily in expanded trinucleotide repeats and the telomeric region of DNA, particularly at low pH. At physiological pH, silver cations were recently found to stabilize C dimers in a C-Ag(+)-C structure analogous to the hemiprotonated C-dimer. Here we use infrared ion spectroscopy in combination with density functional theory calculations at the B3LYP/6-311G+(2df,2p) level to show that copper in the 1+ oxidation state induces an analogous formation of C-Cu(+)-C structures. In contrast to protons and these transition metal ions, alkali metal ions induce a different dimer structure, where each ligand coordinates the alkali metal ion in a bidentate fashion in which the N3 and O2 atoms of both cytosine ligands coordinate to the metal ion, sacrificing hydrogen-bonding interactions between the ligands for improved chelation of the metal cation.

The PDZ motif of the α1C subunit is not required for surface trafficking and adrenergic modulation of CaV1.2 channel in the heart.

Science.gov (United States)

Yang, Lin; Katchman, Alexander; Weinberg, Richard L; Abrams, Jeffrey; Samad, Tahmina; Wan, Elaine; Pitt, Geoffrey S; Marx, Steven O

2015-01-23

Voltage-gated Ca(2+) channels play a key role in initiating muscle excitation-contraction coupling, neurotransmitter release, gene expression, and hormone secretion. The association of CaV1.2 with a supramolecular complex impacts trafficking, localization, turnover, and, most importantly, multifaceted regulation of its function in the heart. Several studies hint at an important role for the C terminus of the α1C subunit as a hub for multidimensional regulation of CaV1.2 channel trafficking and function. Recent studies have demonstrated an important role for the four-residue PDZ binding motif at the C terminus of α1C in interacting with scaffold proteins containing PDZ domains, in the subcellular localization of CaV1.2 in neurons, and in the efficient signaling to cAMP-response element-binding protein in neurons. However, the role of the α1C PDZ ligand domain in the heart is not known. To determine whether the α1C PDZ motif is critical for CaV1.2 trafficking and function in cardiomyocytes, we generated transgenic mice with inducible expression of an N-terminal FLAG epitope-tagged dihydropyridine-resistant α1C with the PDZ motif deleted (ΔPDZ). These mice were crossed with α-myosin heavy chain reverse transcriptional transactivator transgenic mice, and the double-transgenic mice were fed doxycycline. The ΔPDZ channels expressed, trafficked to the membrane, and supported robust excitation-contraction coupling in the presence of nisoldipine, a dihydropyridine Ca(2+) channel blocker, providing functional evidence that they appropriately target to dyads. The ΔPDZ Ca(2+) channels were appropriately regulated by isoproterenol and forskolin. These data indicate that the α1C PDZ motif is not required for surface trafficking, localization to the dyad, or adrenergic stimulation of CaV1.2 in adult cardiomyocytes. © 2015 by The American Society for Biochemistry and Molecular Biology, Inc.

Probabilistic generation of random networks taking into account information on motifs occurrence.

Science.gov (United States)

Bois, Frederic Y; Gayraud, Ghislaine

2015-01-01

Because of the huge number of graphs possible even with a small number of nodes, inference on network structure is known to be a challenging problem. Generating large random directed graphs with prescribed probabilities of occurrences of some meaningful patterns (motifs) is also difficult. We show how to generate such random graphs according to a formal probabilistic representation, using fast Markov chain Monte Carlo methods to sample them. As an illustration, we generate realistic graphs with several hundred nodes mimicking a gene transcription interaction network in Escherichia coli.

Graph Theory Approach for Studying Food Webs

Science.gov (United States)

Longjas, A.; Tejedor, A.; Foufoula-Georgiou, E.

2017-12-01

Food webs are complex networks of feeding interactions among species in ecological communities. Metrics describing food web structure have been proposed to compare and classify food webs ranging from food chain length, connectance, degree distribution, centrality measures, to the presence of motifs (distinct compartments), among others. However, formal methodologies for studying both food web topology and the dynamic processes operating on them are still lacking. Here, we utilize a quantitative framework using graph theory within which a food web is represented by a directed graph, i.e., a collection of vertices (species or trophic species defined as sets of species sharing the same predators and prey) and directed edges (predation links). This framework allows us to identify apex (environmental "source" node) to outlet (top predators) subnetworks and compute the steady-state flux (e.g., carbon, nutrients, energy etc.) in the food web. We use this framework to (1) construct vulnerability maps that quantify the relative change of flux delivery to the top predators in response to perturbations in prey species (2) identify keystone species, whose loss would precipitate further species extinction, and (3) introduce a suite of graph-theoretic metrics to quantify the topologic (imposed by food web connectivity) and dynamic (dictated by the flux partitioning and distribution) components of a food web's complexity. By projecting food webs into a 2D Topodynamic Complexity Space whose coordinates are given by Number of alternative paths (topologic) and Leakage Index (dynamic), we show that this space provides a basis for food web comparison and provide physical insights into their dynamic behavior.

The Rho ADP-ribosylating C3 exoenzyme binds cells via an Arg-Gly-Asp motif.

Science.gov (United States)

Rohrbeck, Astrid; Höltje, Markus; Adolf, Andrej; Oms, Elisabeth; Hagemann, Sandra; Ahnert-Hilger, Gudrun; Just, Ingo

2017-10-27

The Rho ADP-ribosylating C3 exoenzyme (C3bot) is a bacterial protein toxin devoid of a cell-binding or -translocation domain. Nevertheless, C3 can efficiently enter intact cells, including neurons, but the mechanism of C3 binding and uptake is not yet understood. Previously, we identified the intermediate filament vimentin as an extracellular membranous interaction partner of C3. However, uptake of C3 into cells still occurs (although reduced) in the absence of vimentin, indicating involvement of an additional host cell receptor. C3 harbors an Arg-Gly-Asp (RGD) motif, which is the major integrin-binding site, present in a variety of integrin ligands. To check whether the RGD motif of C3 is involved in binding to cells, we performed a competition assay with C3 and RGD peptide or with a monoclonal antibody binding to β1-integrin subunit and binding assays in different cell lines, primary neurons, and synaptosomes with C3-RGD mutants. Here, we report that preincubation of cells with the GRGDNP peptide strongly reduced C3 binding to cells. Moreover, mutation of the RGD motif reduced C3 binding to intact cells and also to recombinant vimentin. Anti-integrin antibodies also lowered the C3 binding to cells. Our results indicate that the RGD motif of C3 is at least one essential C3 motif for binding to host cells and that integrin is an additional receptor for C3 besides vimentin. © 2017 by The American Society for Biochemistry and Molecular Biology, Inc.

Promoter motifs required for c-mpl gene expression induced by thrombopoietin in CMK cells.

Science.gov (United States)

Sunohara, Masataka; Sato, Iwao; Morikawa, Shigeru

2017-11-30

Thrombopoietin (TPO) and its receptor, c-Mpl, are the central regulators of megakaryocyte development and platelet production and are also crucial to regulate megakaryocytopoiesis. TPO remarkably elevated c-mpl promoter activity, while the protein kinase C (PKC) inhibitors, GF109203, H7 and Calphostin C, clearly reduced the steady level of its promoter activity.  In the present study, motifs crucial for c-mpl promoter activity induced by TPO treatment have been analyzed using a human megakaryoblastic cell line, CMK. Destruction of the -107Sp1 and the -57Sp1 sites in the c-mpl promoter enhancer region resulted in decrease of the promoter activity by 53.1% and 64.4%, respectively, and destruction of -69Ets and -28Ets elements dramatically decreased the promoter activity by 96.4% and 87.8%, respectively, while mutation of -77GATA moderately reduced the activity by 31.4%. The result was in agreement with our previous report that showed the crucial motifs in the c-mpl promoter for the promoter activity induced by PMA-treatment. This indicates that TPO-induced activation of the c-mpl promoter activity is fully modulated by transcription through a PKC-dependent pathway and the two Sp1 and two Ets motifs are crucial for the activation of the c-mpl promoter activity rather than a GATA motif in the c-mpl promoter of CMK cells.

On an edge partition and root graphs of some classes of line graphs

Directory of Open Access Journals (Sweden)

K Pravas

2017-04-01

Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity

DEFF Research Database (Denmark)

Ok, Seongmin; Richter, R. Bruce; Thomassen, Carsten

2016-01-01

Let G be a graph and let s be a vertex of G. We consider the structure of the set of all lifts of two edges incident with s that preserve edge-connectivity. Mader proved that two mild hypotheses imply there is at least one pair that lifts, while Frank showed (with the same hypotheses......) that there are at least (deg(s) - 1)/2 disjoint pairs that lift. We consider the lifting graph: its vertices are the edges incident with s, two being adjacent if they form a liftable pair. We have three main results, the first two with the same hypotheses as for Mader’s Theorem. (i)Let F be a subset of the edges incident...... with s. We show that F is independent in the lifting graph of G if and only if there is a single edge-cut C in G of size at most r + 1 containing all the edges in F, where r is the maximum number of edge-disjoint paths from a vertex (not s) in one component of G - C to a vertex (not s) in another...

The graph representation approach to topological field theory in 2 + 1 dimensions

International Nuclear Information System (INIS)

Martin, S.P.

1991-02-01

An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this ''graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual ''connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations

Minimum K_2,3-saturated Graphs

OpenAIRE

Chen, Ya-Chen

2010-01-01

A graph is K_{2,3}-saturated if it has no subgraph isomorphic to K_{2,3}, but does contain a K_{2,3} after the addition of any new edge. We prove that the minimum number of edges in a K_{2,3}-saturated graph on n >= 5 vertices is sat(n, K_{2,3}) = 2n - 3.

The new protein topology graph library web server.

Science.gov (United States)

Schäfer, Tim; Scheck, Andreas; Bruneß, Daniel; May, Patrick; Koch, Ina

2016-02-01

We present a new, extended version of the Protein Topology Graph Library web server. The Protein Topology Graph Library describes the protein topology on the super-secondary structure level. It allows to compute and visualize protein ligand graphs and search for protein structural motifs. The new server features additional information on ligand binding to secondary structure elements, increased usability and an application programming interface (API) to retrieve data, allowing for an automated analysis of protein topology. The Protein Topology Graph Library server is freely available on the web at http://ptgl.uni-frankfurt.de. The website is implemented in PHP, JavaScript, PostgreSQL and Apache. It is supported by all major browsers. The VPLG software that was used to compute the protein ligand graphs and all other data in the database is available under the GNU public license 2.0 from http://vplg.sourceforge.net. tim.schaefer@bioinformatik.uni-frankfurt.de; ina.koch@bioinformatik.uni-frankfurt.de Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

DIMENSI METRIK GRAPH LOBSTER Ln (q;r

Directory of Open Access Journals (Sweden)

PANDE GDE DONY GUMILAR

2013-05-01

Full Text Available The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r. Lobster graph Ln (q;r is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1 is 1, the metric dimension of lobster graph L2 (1;1 for n > 2 is 2.

C-terminal motif prediction in eukaryotic proteomes using comparative genomics and statistical over-representation across protein families

Directory of Open Access Journals (Sweden)

Cutler Sean R

2007-06-01

Full Text Available Abstract Background The carboxy termini of proteins are a frequent site of activity for a variety of biologically important functions, ranging from post-translational modification to protein targeting. Several short peptide motifs involved in protein sorting roles and dependent upon their proximity to the C-terminus for proper function have already been characterized. As a limited number of such motifs have been identified, the potential exists for genome-wide statistical analysis and comparative genomics to reveal novel peptide signatures functioning in a C-terminal dependent manner. We have applied a novel methodology to the prediction of C-terminal-anchored peptide motifs involving a simple z-statistic and several techniques for improving the signal-to-noise ratio. Results We examined the statistical over-representation of position-specific C-terminal tripeptides in 7 eukaryotic proteomes. Sequence randomization models and simple-sequence masking were applied to the successful reduction of background noise. Similarly, as C-terminal homology among members of large protein families may artificially inflate tripeptide counts in an irrelevant and obfuscating manner, gene-family clustering was performed prior to the analysis in order to assess tripeptide over-representation across protein families as opposed to across all proteins. Finally, comparative genomics was used to identify tripeptides significantly occurring in multiple species. This approach has been able to predict, to our knowledge, all C-terminally anchored targeting motifs present in the literature. These include the PTS1 peroxisomal targeting signal (SKL*, the ER-retention signal (K/HDEL*, the ER-retrieval signal for membrane bound proteins (KKxx*, the prenylation signal (CC* and the CaaX box prenylation motif. In addition to a high statistical over-representation of these known motifs, a collection of significant tripeptides with a high propensity for biological function exists

Alanine substitutions in the GXXXG motif alter C99 cleavage by γ-secretase but not its dimerization.

Science.gov (United States)

Higashide, Hidekazu; Ishihara, Seiko; Nobuhara, Mika; Ihara, Yasuo; Funamoto, Satoru

2017-03-01

The amyloid β (Aβ) protein is a major component of senile plaques, one of the neuropathological hallmarks of Alzheimer's disease. Amyloidogenic processing of amyloid precursor protein (APP) by β- and γ-secretases leads to production of Aβ. APP contains tandem triple repeats of the GXXXG motif in its extracellular juxtamembrane and transmembrane regions. It is reported that the GXXXG motif is related to protein-protein interactions, but it remains controversial whether the GXXXG motif in APP is involved in substrate dimerization and whether dimerization affects γ-secretase-dependent cleavage. Therefore, the relationship between the GXXXG motifs, substrate dimerization, and γ-secretase-dependent cleavage sites remains unclear. Here, we applied blue native poly acrylamide gel electrophoresis to examine the effect of alanine substitutions within the GXXXG motifs of APP carboxyl terminal fragment (C99) on its dimerization and Aβ production. Surprisingly, alanine substitutions in the motif failed to alter C99 dimerization in detergent soluble state. Cell-based and solubilized γ-secretase assays demonstrated that increasing alanine substitutions in the motif tended to decrease long Aβ species such as Aβ42 and Aβ43 and to increase in short Aβ species concomitantly. Our data suggest that the GXXXG motif is crucial for Aβ production, but not for C99 dimerization. © 2016 International Society for Neurochemistry.

Crystal structure of 2-hydroxy-N-(2-hydroxyethyl-N-{2-hydroxy-3-[(E-N-hydroxyethanimidoyl]-5-methylbenzyl}ethanaminium acetate monohydrate

Directory of Open Access Journals (Sweden)

Gary S. Nichol

2015-03-01

Full Text Available The structure of the title hydrated molecular salt, C14H23N2O4+·C2H3O2−·H2O, was determined as part of a wider study on the use of the molecule as a polydentate ligand in the synthesis of MnIII clusters with magnetic properties. The cation features intramolecular O—H...N and N—H...O hydrogen-bond interactions. The crystal structure features a range of intermolecular hydrogen-bonding interactions, principally O—H...O interactions between all three species in the asymmetric unit. An R24(8 graph-set hydrogen-bonding motif between the anion and water molecules serves as a unit which links to the cation via the diethanolamine group. Each O atom of the acetate anion accepts two hydrogen bonds.

Genus Ranges of 4-Regular Rigid Vertex Graphs.

Science.gov (United States)

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2015-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2 n vertices ( n > 1), we prove that all intervals [ a, b ] for all a genus ranges. For graphs with 2 n - 1 vertices ( n ≥ 1), we prove that all intervals [ a, b ] for all a genus ranges. We also provide constructions of graphs that realize these ranges.

On the stretch factor of convex Delaunay graphs

Directory of Open Access Journals (Sweden)

Prosenjit Bose

2010-06-01

Full Text Available Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.

Well-covered graphs and factors

DEFF Research Database (Denmark)

Randerath, Bert; Vestergaard, Preben D.

2006-01-01

A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...

Decomposing a planar graph of girth 5 into an independent set and a forest

DEFF Research Database (Denmark)

Kawarabayashi, Ken-ichi; Thomassen, Carsten

2009-01-01

We use a list-color technique to extend the result of Borodin and Glebov that the vertex set of every planar graph of girth at least 5 can be partitioned into an independent set and a set which induces a forest. We apply this extension to also extend Grötzsch's theorem that every planar triangle-...

On the classification of nonsimple graph C*-algebras

DEFF Research Database (Denmark)

Eilers, Søren; Tomforde, Mark

2010-01-01

results are based on a general method developed by the first named author with Restorff and Ruiz. As a key step in the argument, we show how to produce stability for certain full hereditary subalgebras associated to such graph C*-algebras. We further prove that, except under trivial circumstances...

Cycles through all finite vertex sets in infinite graphs

DEFF Research Database (Denmark)

Kundgen, Andre; Li, Binlong; Thomassen, Carsten

2017-01-01

is contained in a cycle of G. We apply this to extend a number of results and conjectures on finite graphs to Hamiltonian curves in infinite locally finite graphs. For example, Barnette’s conjecture (that every finite planar cubic 3-connected bipartite graph is Hamiltonian) is equivalent to the statement...

RMOD: a tool for regulatory motif detection in signaling network.

Directory of Open Access Journals (Sweden)

Jinki Kim

Full Text Available Regulatory motifs are patterns of activation and inhibition that appear repeatedly in various signaling networks and that show specific regulatory properties. However, the network structures of regulatory motifs are highly diverse and complex, rendering their identification difficult. Here, we present a RMOD, a web-based system for the identification of regulatory motifs and their properties in signaling networks. RMOD finds various network structures of regulatory motifs by compressing the signaling network and detecting the compressed forms of regulatory motifs. To apply it into a large-scale signaling network, it adopts a new subgraph search algorithm using a novel data structure called path-tree, which is a tree structure composed of isomorphic graphs of query regulatory motifs. This algorithm was evaluated using various sizes of signaling networks generated from the integration of various human signaling pathways and it showed that the speed and scalability of this algorithm outperforms those of other algorithms. RMOD includes interactive analysis and auxiliary tools that make it possible to manipulate the whole processes from building signaling network and query regulatory motifs to analyzing regulatory motifs with graphical illustration and summarized descriptions. As a result, RMOD provides an integrated view of the regulatory motifs and mechanism underlying their regulatory motif activities within the signaling network. RMOD is freely accessible online at the following URL: http://pks.kaist.ac.kr/rmod.

Integer Flows and Circuit Covers of Graphs and Signed Graphs

Science.gov (United States)

Cheng, Jian

The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

Normal edge-transitive and $ frac{1}{2}$-arc-transitive Cayley graphs on non-abelian groups of order $2pq$ , $p > q$ are primes

Directory of Open Access Journals (Sweden)

Ali Reza Ashrafi

2016-09-01

Full Text Available Darafsheh and Assari in [Normal edge-transitive Cayley graphs onnon-abelian groups of order 4p, where p is a prime number,Sci. China Math. {bf 56} (1 (2013 213$-$219.] classified the connected normal edge transitive and$frac{1}{2}-$arc-transitive Cayley graph of groups of order$4p$. In this paper we continue this work by classifying theconnected Cayley graph of groups of order $2pq$, $p > q$ areprimes. As a consequence it is proved that $Cay(G,S$ is a$frac{1}{2}-$edge-transitive Cayley graph of order $2pq$, $p> q$ if and only if $|S|$ is an even integer greater than 2, $S =T cup T^{-1}$ and $T subseteq { cba^{i} | 0 leq i leq p- 1}$ such that $T$ and $T^{-1}$ are orbits of $Aut(G,S$ andbegin{eqnarray*}G &=& langle a, b, c | a^p = b^q = c^2 = e, ac = ca, bc = cb, b^{-1}ab = a^r rangle,G &=& langle a, b, c | a^p = b^q = c^2 = e, c ac = a^{-1}, bc = cb, b^{-1}ab = a^r rangle,end{eqnarray*}where $r^q equiv 1 (mod p$.

Some Results on the Graph Theory for Complex Neutrosophic Sets

Directory of Open Access Journals (Sweden)

Shio Gai Quek

2018-05-01

Full Text Available Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graphs called complex neutrosophic graphs of type 1 (abbr. CNG1. We then present a matrix representation for it and study some properties of this new concept. The concept of CNG1 is an extension of the generalized fuzzy graphs of type 1 (GFG1 and generalized single-valued neutrosophic graphs of type 1 (GSVNG1. The utility of the CNG1 introduced here are applied to a multi-attribute decision making problem related to Internet server selection.

Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

Directory of Open Access Journals (Sweden)

Tomasz Kajdanowicz

2016-09-01

Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

Expression, refolding and crystallizations of the Grb2-like (GADS) C-terminal SH3 domain complexed with a SLP-76 motif peptide

International Nuclear Information System (INIS)

Faravelli, Alessandro; Dimasi, Nazzareno

2005-01-01

Several crystals of the Grb2-like C-terminal SH3 domain in complex with a motif peptide from the SLP-76 protein were obtained and characterized. The Grb2-like adaptor protein GADS is composed of an N-terminal SH3 domain, an SH2 domain, a proline-rich region and a C-terminal SH3 domain. GADS interacts through its C-terminal SH3 domain with the adaptor protein SLP-76, thus recruiting this protein and other associated molecules to the linker for activation of T-cell (LAT) protein. The DNA encoding the C-terminal SH3 domain of GADS (GADS-cSH3) was assembled synthetically using a recursive PCR technique and the protein was overexpressed in Escherichia coli, refolded and purified. Several crystals of this domain in complex with the SLP-76 peptide were obtained and characterized

Summary: beyond fault trees to fault graphs

International Nuclear Information System (INIS)

Alesso, H.P.; Prassinos, P.; Smith, C.F.

1984-09-01

Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability

Fibonacci number of the tadpole graph

Directory of Open Access Journals (Sweden)

Joe DeMaio

2014-10-01

Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

Discovery of candidate KEN-box motifs using cell cycle keyword enrichment combined with native disorder prediction and motif conservation.

Science.gov (United States)

Michael, Sushama; Travé, Gilles; Ramu, Chenna; Chica, Claudia; Gibson, Toby J

2008-02-15

KEN-box-mediated target selection is one of the mechanisms used in the proteasomal destruction of mitotic cell cycle proteins via the APC/C complex. While annotating the Eukaryotic Linear Motif resource (ELM, http://elm.eu.org/), we found that KEN motifs were significantly enriched in human protein entries with cell cycle keywords in the UniProt/Swiss-Prot database-implying that KEN-boxes might be more common than reported. Matches to short linear motifs in protein database searches are not, per se, significant. KEN-box enrichment with cell cycle Gene Ontology terms suggests that collectively these motifs are functional but does not prove that any given instance is so. Candidates were surveyed for native disorder prediction using GlobPlot and IUPred and for motif conservation in homologues. Among >25 strong new candidates, the most notable are human HIPK2, CHFR, CDC27, Dab2, Upf2, kinesin Eg5, DNA Topoisomerase 1 and yeast Cdc5 and Swi5. A similar number of weaker candidates were present. These proteins have yet to be tested for APC/C targeted destruction, providing potential new avenues of research.

MODA: an efficient algorithm for network motif discovery in biological networks.

Science.gov (United States)

Omidi, Saeed; Schreiber, Falk; Masoudi-Nejad, Ali

2009-10-01

In recent years, interest has been growing in the study of complex networks. Since Erdös and Rényi (1960) proposed their random graph model about 50 years ago, many researchers have investigated and shaped this field. Many indicators have been proposed to assess the global features of networks. Recently, an active research area has developed in studying local features named motifs as the building blocks of networks. Unfortunately, network motif discovery is a computationally hard problem and finding rather large motifs (larger than 8 nodes) by means of current algorithms is impractical as it demands too much computational effort. In this paper, we present a new algorithm (MODA) that incorporates techniques such as a pattern growth approach for extracting larger motifs efficiently. We have tested our algorithm and found it able to identify larger motifs with more than 8 nodes more efficiently than most of the current state-of-the-art motif discovery algorithms. While most of the algorithms rely on induced subgraphs as motifs of the networks, MODA is able to extract both induced and non-induced subgraphs simultaneously. The MODA source code is freely available at: http://LBB.ut.ac.ir/Download/LBBsoft/MODA/

Upper bound for the span of pencil graph

Science.gov (United States)

Parvathi, N.; Vimala Rani, A.

2018-04-01

An L(2,1)-Coloring or Radio Coloring or λ coloring of a graph is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x) ‑ f(y)| ≥ 2 if d(x,y) = 1 and |f(x) ‑ f(y)| ≥ 1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-coloring number or span number λ(G) of G is the smallest number k such that G has an L(2,1)-coloring with max{f(v) : v ∈ V(G)} = k. [2]The minimum number of colors used in L(2,1)-coloring is called the radio number rn(G) of G (Positive integer). Griggs and yeh conjectured that λ(G) ≤ Δ2 for any simple graph with maximum degree Δ>2. In this article, we consider some special graphs like, n-sunlet graph, pencil graph families and derive its upper bound of (G) and rn(G).

Improved i-motif thermal stability by insertion of anthraquinone monomers

DEFF Research Database (Denmark)

Gouda, Alaa S; Amine, Mahasen S.; Pedersen, Erik Bjerregaard

2017-01-01

In order to gain insight into how to improve thermal stability of i-motifs when used in the context of biomedical and nanotechnological applications, novel anthraquinone-modified i-motifs were synthesized by insertion of 1,8-, 1,4-, 1,5- and 2,6-disubstituted anthraquinone monomers into the TAA...... loops of a 22mer cytosine-rich human telomeric DNA sequence. The influence of the four anthraquinone linkers on the i-motif thermal stability was investigated at 295 nm and pH 5.5. Anthraquinone monomers modulate the i-motif stability in a position-depending manner and the modulation also depends...... unlocked nucleic acid monomers or twisted intercalating nucleic acid. The 2,6-disubstituted anthraquinone linker replacing T10 enabled a significant increase of i-motif thermal melting by 8.2 °C. A substantial increase of 5.0 °C in i-motif thermal melting was recorded when both A6 and T16 were modified...

On some covering graphs of a graph

Directory of Open Access Journals (Sweden)

Shariefuddin Pirzada

2016-10-01

Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\

The methyltransferase NSD3 has chromatin-binding motifs, PHD5-C5HCH, that are distinct from other NSD (nuclear receptor SET domain) family members in their histone H3 recognition.

Science.gov (United States)

He, Chao; Li, Fudong; Zhang, Jiahai; Wu, Jihui; Shi, Yunyu

2013-02-15

The NSD (nuclear receptor SET domain-containing) family members, consisting of NSD1, NSD2 (MMSET/WHSC1), and NSD3 (WHSC1L1), are SET domain-containing methyltransferases and aberrant expression of each member has been implicated in multiple diseases. They have specific mono- and dimethylase activities for H3K36, whereas play nonredundant roles during development. Aside from the well characterized catalytic SET domain, NSD proteins have multiple potential chromatin-binding motifs that are clinically relevant, including the fifth plant homeodomain (PHD5) and the adjacent Cys-His-rich domain (C5HCH) located at the C terminus. Herein, we report the crystal structures of the PHD5-C5HCH module of NSD3, in the free state and in complex with H3(1-7) (H3 residues 1-7), H3(1-15) (H3 residues 1-15), and H3(1-15)K9me3 (H3 residues 1-15 with trimethylation on K9) peptides. These structures reveal that the PHD5 and C5HCH domains fold into a novel integrated PHD-PHD-like structural module with H3 peptide bound only on the surface of PHD5 and provide the molecular basis for the recognition of unmodified H3K4 and trimethylated H3K9 by NSD3 PHD5. Structural studies and binding assays show that differences exist in histone binding specificity of the PHD5 domain between three members of the NSD family. For NSD2, the PHD5-C5HCH:H3 N terminus interaction is largely conserved, although with a stronger preference for unmethylated H3K9 (H3K9me0) than trimethylated H3K9 (H3K9me3), and NSD1 PHD5-C5HCH does not bind to H3 peptides. Our results shed light on how NSD proteins that mediate H3K36 methylation are localized to specific genomic sites and provide implications for the mechanism of functional diversity of NSD proteins.

Efficient motif finding algorithms for large-alphabet inputs

Directory of Open Access Journals (Sweden)

Pavlovic Vladimir

2010-10-01

Full Text Available Abstract Background We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. Results The proposed algorithm (1 improves search efficiency compared to existing algorithms, and (2 scales well with the size of alphabet. On a synthetic planted DNA motif finding problem our algorithm is over 10× more efficient than MITRA, PMSPrune, and RISOTTO for long motifs. Improvements are orders of magnitude higher in the same setting with large alphabets. On benchmark TF-binding site problems (FNP, CRP, LexA we observed reduction in running time of over 12×, with high detection accuracy. The algorithm was also successful in rapidly identifying protein motifs in Lipocalin, Zinc metallopeptidase, and supersecondary structure motifs for Cadherin and Immunoglobin families. Conclusions Our algorithm reduces computational complexity of the current motif finding algorithms and demonstrate strong running time improvements over existing exact algorithms, especially in important and difficult cases of large-alphabet sequences.

Orientations of infinite graphs with prescribed edge-connectivity

DEFF Research Database (Denmark)

Thomassen, Carsten

2016-01-01

We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex...... set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity). Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989....

BayesMotif: de novo protein sorting motif discovery from impure datasets.

Science.gov (United States)

Hu, Jianjun; Zhang, Fan

2010-01-18

Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regulated by protein sorting signals in different forms. A major category of sorting signals are amino acid sub-sequences usually located at the N-terminals or C-terminals of protein sequences. Genome-wide experimental identification of protein sorting signals is extremely time-consuming and costly. Effective computational algorithms for de novo discovery of protein sorting signals is needed to improve the understanding of protein sorting mechanisms. We formulated the protein sorting motif discovery problem as a classification problem and proposed a Bayesian classifier based algorithm (BayesMotif) for de novo identification of a common type of protein sorting motifs in which a highly conserved anchor is present along with a less conserved motif regions. A false positive removal procedure is developed to iteratively remove sequences that are unlikely to contain true motifs so that the algorithm can identify motifs from impure input sequences. Experiments on both implanted motif datasets and real-world datasets showed that the enhanced BayesMotif algorithm can identify anchored sorting motifs from pure or impure protein sequence dataset. It also shows that the false positive removal procedure can help to identify true motifs even when there is only 20% of the input sequences containing true motif instances. We proposed BayesMotif, a novel Bayesian classification based algorithm for de novo discovery of a special category of anchored protein sorting motifs from impure datasets. Compared to conventional motif discovery algorithms such as MEME, our algorithm can find less-conserved motifs with short highly conserved anchors. Our algorithm also has the advantage of easy incorporation of additional meta-sequence features such as hydrophobicity or charge of the motifs which may help to overcome the limitations of

On the partition dimension of two-component graphs

Indian Academy of Sciences (India)

D O Haryeni

2017-11-17

Nov 17, 2017 ... Partition dimension; disconnected graph; component. 2010 Mathematics Subject Classification. 05C12, 05C15. 1. Introduction. The study of the partition dimension for graphs was initiated by Chartrand et al. [2] aimed at finding a new way to solve the problem in metric dimensions of graphs. Many results.

3-biplacement of bipartite graphs

Directory of Open Access Journals (Sweden)

Lech Adamus

2008-01-01

Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.

On P2 ⋄ Pn -supermagic labeling of edge corona product of cycle and path graph

Science.gov (United States)

Yulianto, R.; Martini, Titin S.

2018-04-01

A simple graph G = (V, E) admits a H-covering, where H is subgraph of G, if every edge in E belongs to a subgraph of G isomorphic to H. Graph G is H-magic if there is a total labeling f:V(G)\\cup E(G)\\to 1,2,\\ldots,|V(G)|+|E(G)|, such that each subgraph {H}{\\prime }=({V}{\\prime },{E}{\\prime }) of G isomorphic to H and satisfying f{({H}{\\prime })}=def{\\sum }\\upsilon \\in {V{\\prime }}f(\\upsilon )+{\\sum }e\\in {E{\\prime }}f(e)=m(f) where m(f) is a constant magic sum. Additionaly, G admits H-supermagic if f(V)=1,2,\\ldots,|V|. The edge corona {C}n \\diamond {P}n of Cn and Pn is defined as the graph obtained by taking one copy of Cn and n copies of Pn , and then joining two end-vertices of the i-th edge of Cn to every vertex in the i-th copy of Pn . This research aim is to find H-supermagic covering on an edge corona product of cycle and path graph {C}n \\diamond {P}n where H is {P}2 \\diamond {P}n. We use k-balanced multiset to solve our reserarch. Here, we find that an edge corona product of cycle and path graph {C}n \\diamond {P}n is {P}2 \\diamond {P}n supermagic for n > 3.

Network motif frequency vectors reveal evolving metabolic network organisation.

Science.gov (United States)

Pearcy, Nicole; Crofts, Jonathan J; Chuzhanova, Nadia

2015-01-01

At the systems level many organisms of interest may be described by their patterns of interaction, and as such, are perhaps best characterised via network or graph models. Metabolic networks, in particular, are fundamental to the proper functioning of many important biological processes, and thus, have been widely studied over the past decade or so. Such investigations have revealed a number of shared topological features, such as a short characteristic path-length, large clustering coefficient and hierarchical modular structure. However, the extent to which evolutionary and functional properties of metabolism manifest via this underlying network architecture remains unclear. In this paper, we employ a novel graph embedding technique, based upon low-order network motifs, to compare metabolic network structure for 383 bacterial species categorised according to a number of biological features. In particular, we introduce a new global significance score which enables us to quantify important evolutionary relationships that exist between organisms and their physical environments. Using this new approach, we demonstrate a number of significant correlations between environmental factors, such as growth conditions and habitat variability, and network motif structure, providing evidence that organism adaptability leads to increased complexities in the resultant metabolic networks.

Ethyl 27-oxo-15-oxa-2,20-diazahexacyclo[18.6.1.01,8.02,6.09,14.021,26]heptacosa-9,11,13,21,23,25-hexaene-7-carboxylate

Directory of Open Access Journals (Sweden)

Devadasan Velmurugan

2013-01-01

Full Text Available In the title compound, C27H30N2O4, the pyrrolidine ring adopts a twisted conformation. The indoline ring system is almost perpendicular to the mean plane of the pyrrolidine ring, making a dihedral angle of 81.7 (8°. In the crystal, molecules are linked into centrosymmetric dimers with graph-set motif R22(16 via pairs of C—H...O hydrogen bonds. The terminal ethyl group of the ester group is disordered over two sets of sites, with a site-occupancy ratio of 0.587 (11:0.413 (11.

A local search for a graph clustering problem

Science.gov (United States)

Navrotskaya, Anna; Il'ev, Victor

2016-10-01

In the clustering problems one has to partition a given set of objects (a data set) into some subsets (called clusters) taking into consideration only similarity of the objects. One of most visual formalizations of clustering is graph clustering, that is grouping the vertices of a graph into clusters taking into consideration the edge structure of the graph whose vertices are objects and edges represent similarities between the objects. In the graph k-clustering problem the number of clusters does not exceed k and the goal is to minimize the number of edges between clusters and the number of missing edges within clusters. This problem is NP-hard for any k ≥ 2. We propose a polynomial time (2k-1)-approximation algorithm for graph k-clustering. Then we apply a local search procedure to the feasible solution found by this algorithm and hold experimental research of obtained heuristics.

Forbidden minors for the class of graphs G with $\\xi (G) \\leq 2$

NARCIS (Netherlands)

Hogben, L.; Holst, van der H.

2007-01-01

For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entry is nonzero whenever i¿j and ij is an edge in G. In [F. Barioli, S. Fallat, L. Hogben, A variant on the graph parameters of Colin de Verdière: Implications to the minimum rank of graphs, Electron. J.

Functional motifs responsible for human metapneumovirus M2-2-mediated innate immune evasion.

Science.gov (United States)

Chen, Yu; Deng, Xiaoling; Deng, Junfang; Zhou, Jiehua; Ren, Yuping; Liu, Shengxuan; Prusak, Deborah J; Wood, Thomas G; Bao, Xiaoyong

2016-12-01

Human metapneumovirus (hMPV) is a major cause of lower respiratory infection in young children. Repeated infections occur throughout life, but its immune evasion mechanisms are largely unknown. We recently found that hMPV M2-2 protein elicits immune evasion by targeting mitochondrial antiviral-signaling protein (MAVS), an antiviral signaling molecule. However, the molecular mechanisms underlying such inhibition are not known. Our mutagenesis studies revealed that PDZ-binding motifs, 29-DEMI-32 and 39-KEALSDGI-46, located in an immune inhibitory region of M2-2, are responsible for M2-2-mediated immune evasion. We also found both motifs prevent TRAF5 and TRAF6, the MAVS downstream adaptors, to be recruited to MAVS, while the motif 39-KEALSDGI-46 also blocks TRAF3 migrating to MAVS. In parallel, these TRAFs are important in activating transcription factors NF-kB and/or IRF-3 by hMPV. Our findings collectively demonstrate that M2-2 uses its PDZ motifs to launch the hMPV immune evasion through blocking the interaction of MAVS and its downstream TRAFs. Copyright © 2016 Elsevier Inc. All rights reserved.

Total edge irregularity strength of (n,t)-kite graph

Science.gov (United States)

Winarsih, Tri; Indriati, Diari

2018-04-01

Let G(V, E) be a simple, connected, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, …, k}. An edge irregular total k-labeling λ :V(G)\\cup E(G)\\to \\{1,2,\\ldots,k\\} of a graph G is a labeling of vertices and edges of G in such a way that for any different edges e and f, weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The total edge irregularity strength of G, tes(G), is defined as the minimum k for which a graph G has an edge irregular total k-labeling. An (n, t)-kite graph consist of a cycle of length n with a t-edge path (the tail) attached to one vertex of a cycle. In this paper, we investigate the total edge irregularity strength of the (n, t)-kite graph, with n > 3 and t > 1. We obtain the total edge irregularity strength of the (n, t)-kite graph is tes((n, t)-kite) = \\lceil \\frac{n+t+2}{3}\\rceil .

Flupentixol tartrate.

Science.gov (United States)

Yamuna, Thammarse S; Kaur, Manpreet; Anderson, Brian J; Jasinski, Jerry P; Yathirajan, H S

2014-02-01

In the title salt, C23H26F3N2OS(+)·C4H5O6 (-) [systematic name: 1-(2-hy-droxy-eth-yl)-4-[3-(2-(tri-fluoro-meth-yl)thioxanthen-9-yl-idene)prop-yl]piperazin-1-ium 3-carb-oxy-2,3-di-hydroxy-pro-pion-ate], the monoprotonated piperazine ring in the cation adopts a chair conformation, while the thio-pyran ring of the thioxanthene group has a boat conformation. The dihedral angle between the mean planes of the two outer aromatic rings of the thioxanthene groups is 31.6 (2)°. In the crystal, the cations and anions are linked via O-H⋯O, N-H⋯O, O-H⋯N and C-H⋯O hydrogen bonds, forming chains propagating along [100]. In addition, R (2) 2(7), R (2) 2(11), R (2) 2(10) and R (2) 2(12) graph-set ring motifs involving the anions, and R (2) 2(9) graph-set ring motifs involving both the cations and anions are observed. The three F atoms of the tri-fluoro-methyl group are disordered over two sets of sites and the individual atoms were refined with occupancy ratios of 0.54 (6):0.46 (6), 0.72 (2):0.28 (2) and 0.67 (3):0.33 (3).

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

1999-01-01

We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

Labeled Embedding Of (n, n-2-Graphs In Their Complements

Directory of Open Access Journals (Sweden)

Tahraoui M.-A.

2017-11-01

Full Text Available Graph packing generally deals with unlabeled graphs. In [4], the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees [M.A. Tahraoui, E. Duchêne and H. Kheddouci, Labeled 2-packings of trees, Discrete Math. 338 (2015 816-824] and cycles [E. Duchˆene, H. Kheddouci, R.J. Nowakowski and M.A. Tahraoui, Labeled packing of graphs, Australas. J. Combin. 57 (2013 109-126]. In this note, we present a lower bound on the labeled packing number of any (n, n − 2-graph into Kn. This result improves the bound given by Woźniak in [Embedding graphs of small size, Discrete Appl. Math. 51 (1994 233-241].

Steiner Distance in Graphs--A Survey

OpenAIRE

Mao, Yaping

2017-01-01

For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...

Partitioning graphs into connected parts

NARCIS (Netherlands)

Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.

2009-01-01

The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest

Computational Study on a PTAS for Planar Dominating Set Problem

Directory of Open Access Journals (Sweden)

Qian-Ping Gu

2013-01-01

Full Text Available The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time approximation scheme (PTAS for a class of NP-hard problems in planar graphs. It is mentioned that the framework can be applied to obtain an O(2ckn time, c is a constant, (1+1/k-approximation algorithm for the planar dominating set problem. We show that the approximation ratio achieved by the mentioned application of the framework is not bounded by any constant for the planar dominating set problem. We modify the application of the framework to give a PTAS for the planar dominating set problem. With k-outer planar graph decompositions, the modified PTAS has an approximation ratio (1 + 2/k. Using 2k-outer planar graph decompositions, the modified PTAS achieves the approximation ratio (1+1/k in O(22ckn time. We report a computational study on the modified PTAS. Our results show that the modified PTAS is practical.

Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae

Directory of Open Access Journals (Sweden)

Christian J. Michel

2017-12-01

Full Text Available A set X of 20 trinucleotides has been found to have the highest average occurrence in the reading frame, compared to the two shifted frames, of genes of bacteria, archaea, eukaryotes, plasmids and viruses. This set X has an interesting mathematical property, since X is a maximal C 3 self-complementary trinucleotide circular code. Furthermore, any motif obtained from this circular code X has the capacity to retrieve, maintain and synchronize the original (reading frame. Since 1996, the theory of circular codes in genes has mainly been developed by analysing the properties of the 20 trinucleotides of X , using combinatorics and statistical approaches. For the first time, we test this theory by analysing the X motifs, i.e., motifs from the circular code X , in the complete genome of the yeast Saccharomyces cerevisiae. Several properties of X motifs are identified by basic statistics (at the frequency level, and evaluated by comparison to R motifs, i.e., random motifs generated from 30 different random codes R . We first show that the frequency of X motifs is significantly greater than that of R motifs in the genome of S. cerevisiae. We then verify that no significant difference is observed between the frequencies of X and R motifs in the non-coding regions of S. cerevisiae, but that the occurrence number of X motifs is significantly higher than R motifs in the genes (protein-coding regions. This property is true for all cardinalities of X motifs (from 4 to 20 and for all 16 chromosomes. We further investigate the distribution of X motifs in the three frames of S. cerevisiae genes and show that they occur more frequently in the reading frame, regardless of their cardinality or their length. Finally, the ratio of X genes, i.e., genes with at least one X motif, to non- X genes, in the set of verified genes is significantly different to that observed in the set of putative or dubious genes with no experimental evidence. These results, taken together

Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae.

Science.gov (United States)

Michel, Christian J; Ngoune, Viviane Nguefack; Poch, Olivier; Ripp, Raymond; Thompson, Julie D

2017-12-03

A set X of 20 trinucleotides has been found to have the highest average occurrence in the reading frame, compared to the two shifted frames, of genes of bacteria, archaea, eukaryotes, plasmids and viruses. This set X has an interesting mathematical property, since X is a maximal C3 self-complementary trinucleotide circular code. Furthermore, any motif obtained from this circular code X has the capacity to retrieve, maintain and synchronize the original (reading) frame. Since 1996, the theory of circular codes in genes has mainly been developed by analysing the properties of the 20 trinucleotides of X, using combinatorics and statistical approaches. For the first time, we test this theory by analysing the X motifs, i.e., motifs from the circular code X, in the complete genome of the yeast Saccharomyces cerevisiae . Several properties of X motifs are identified by basic statistics (at the frequency level), and evaluated by comparison to R motifs, i.e., random motifs generated from 30 different random codes R. We first show that the frequency of X motifs is significantly greater than that of R motifs in the genome of S. cerevisiae . We then verify that no significant difference is observed between the frequencies of X and R motifs in the non-coding regions of S. cerevisiae , but that the occurrence number of X motifs is significantly higher than R motifs in the genes (protein-coding regions). This property is true for all cardinalities of X motifs (from 4 to 20) and for all 16 chromosomes. We further investigate the distribution of X motifs in the three frames of S. cerevisiae genes and show that they occur more frequently in the reading frame, regardless of their cardinality or their length. Finally, the ratio of X genes, i.e., genes with at least one X motif, to non-X genes, in the set of verified genes is significantly different to that observed in the set of putative or dubious genes with no experimental evidence. These results, taken together, represent the first

The circumference of the square of a connected graph

DEFF Research Database (Denmark)

Brandt, S.; Muttel, J.; Rautenbach, D.

2014-01-01

The celebrated result of Fleischner states that the square of every 2-connected graph is Hamiltonian. We investigate what happens if the graph is just connected. For every n a parts per thousand yen 3, we determine the smallest length c(n) of a longest cycle in the square of a connected graph of ...... of order n and show that c(n) is a logarithmic function in n. Furthermore, for every c a parts per thousand yen 3, we characterize the connected graphs of largest order whose square contains no cycle of length at least c....

Collective Rationality in Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.

2014-01-01

Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the

A family of mixed graphs with large order and diameter 2

OpenAIRE

Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Miller, Mirka; Zdimalova, Maria

2017-01-01

A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree. A mixed regular graphs is said to be optimal if there is not a mixed regular graph with the same parameters and bigger order. We present a construction that provides mixed graphs of undirected degree qq, directed degree View the MathML sourceq-12 and order 2q22q2, for qq being an odd prime power. Since the Moore bound for a mixed graph with th...

Downhill Domination in Graphs

Directory of Open Access Journals (Sweden)

Haynes Teresa W.

2014-08-01

Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds

Structural properties of recursively partitionable graphs with connectivity 2

DEFF Research Database (Denmark)

Baudon, Olivier; Bensmail, Julien; Foucaud, Florent

2017-01-01

, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be con-nected but also ful_l additional conditions. In this paper, we point out some structural...... properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called...

Automated classification of RNA 3D motifs and the RNA 3D Motif Atlas

Science.gov (United States)

Petrov, Anton I.; Zirbel, Craig L.; Leontis, Neocles B.

2013-01-01

The analysis of atomic-resolution RNA three-dimensional (3D) structures reveals that many internal and hairpin loops are modular, recurrent, and structured by conserved non-Watson–Crick base pairs. Structurally similar loops define RNA 3D motifs that are conserved in homologous RNA molecules, but can also occur at nonhomologous sites in diverse RNAs, and which often vary in sequence. To further our understanding of RNA motif structure and sequence variability and to provide a useful resource for structure modeling and prediction, we present a new method for automated classification of internal and hairpin loop RNA 3D motifs and a new online database called the RNA 3D Motif Atlas. To classify the motif instances, a representative set of internal and hairpin loops is automatically extracted from a nonredundant list of RNA-containing PDB files. Their structures are compared geometrically, all-against-all, using the FR3D program suite. The loops are clustered into motif groups, taking into account geometric similarity and structural annotations and making allowance for a variable number of bulged bases. The automated procedure that we have implemented identifies all hairpin and internal loop motifs previously described in the literature. All motif instances and motif groups are assigned unique and stable identifiers and are made available in the RNA 3D Motif Atlas (http://rna.bgsu.edu/motifs), which is automatically updated every four weeks. The RNA 3D Motif Atlas provides an interactive user interface for exploring motif diversity and tools for programmatic data access. PMID:23970545

Efficient Graph Computation for Node2Vec

OpenAIRE

Zhou, Dongyan; Niu, Songjie; Chen, Shimin

2018-01-01

Node2Vec is a state-of-the-art general-purpose feature learning method for network analysis. However, current solutions cannot run Node2Vec on large-scale graphs with billions of vertices and edges, which are common in real-world applications. The existing distributed Node2Vec on Spark incurs significant space and time overhead. It runs out of memory even for mid-sized graphs with millions of vertices. Moreover, it considers at most 30 edges for every vertex in generating random walks, causin...

On cordial labeling of double duplication for some families of graph

Science.gov (United States)

Shobana, L.; Remigius Perpetua Mary, F.

2018-04-01

Let G (V, E) be a simple undirected graph where V,E are its vertex set and edge set respectively. Consider a labeling where f bea function from the vertices of G to {0, 1} and for each edge xy assign the label|f(x)-f(y)|. Then f is called cordial of G if the number of vertices labeled 0 and the number of vertices labeled 1 differs by at most 1 and the number of edges labeled 0 and the number of edges labeled 1 differs by at most 1. In this paper we proved the existence of cordial labeling for double duplication of path graph Pn: n≥2, cycle graph Cn: n≥3 except for n≡2 (mod 4), wheel graph Wn:n≥5 except for n≥3 (mod 4), flower graph Fn: n≥5 and bistar graph Bm,n: m,n≥2.

ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

OpenAIRE

Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

2016-01-01

In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

Science.gov (United States)

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

MSDmotif: exploring protein sites and motifs

Directory of Open Access Journals (Sweden)

Henrick Kim

2008-07-01

Full Text Available Abstract Background Protein structures have conserved features – motifs, which have a sufficient influence on the protein function. These motifs can be found in sequence as well as in 3D space. Understanding of these fragments is essential for 3D structure prediction, modelling and drug-design. The Protein Data Bank (PDB is the source of this information however present search tools have limited 3D options to integrate protein sequence with its 3D structure. Results We describe here a web application for querying the PDB for ligands, binding sites, small 3D structural and sequence motifs and the underlying database. Novel algorithms for chemical fragments, 3D motifs, ϕ/ψ sequences, super-secondary structure motifs and for small 3D structural motif associations searches are incorporated. The interface provides functionality for visualization, search criteria creation, sequence and 3D multiple alignment options. MSDmotif is an integrated system where a results page is also a search form. A set of motif statistics is available for analysis. This set includes molecule and motif binding statistics, distribution of motif sequences, occurrence of an amino-acid within a motif, correlation of amino-acids side-chain charges within a motif and Ramachandran plots for each residue. The binding statistics are presented in association with properties that include a ligand fragment library. Access is also provided through the distributed Annotation System (DAS protocol. An additional entry point facilitates XML requests with XML responses. Conclusion MSDmotif is unique by combining chemical, sequence and 3D data in a single search engine with a range of search and visualisation options. It provides multiple views of data found in the PDB archive for exploring protein structures.

Neural complexity: A graph theoretic interpretation

Science.gov (United States)

Barnett, L.; Buckley, C. L.; Bullock, S.

2011-04-01

One of the central challenges facing modern neuroscience is to explain the ability of the nervous system to coherently integrate information across distinct functional modules in the absence of a central executive. To this end, Tononi [Proc. Natl. Acad. Sci. USA.PNASA60027-842410.1073/pnas.91.11.5033 91, 5033 (1994)] proposed a measure of neural complexity that purports to capture this property based on mutual information between complementary subsets of a system. Neural complexity, so defined, is one of a family of information theoretic metrics developed to measure the balance between the segregation and integration of a system’s dynamics. One key question arising for such measures involves understanding how they are influenced by network topology. Sporns [Cereb. Cortex53OPAV1047-321110.1093/cercor/10.2.127 10, 127 (2000)] employed numerical models in order to determine the dependence of neural complexity on the topological features of a network. However, a complete picture has yet to be established. While De Lucia [Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.71.016114 71, 016114 (2005)] made the first attempts at an analytical account of this relationship, their work utilized a formulation of neural complexity that, we argue, did not reflect the intuitions of the original work. In this paper we start by describing weighted connection matrices formed by applying a random continuous weight distribution to binary adjacency matrices. This allows us to derive an approximation for neural complexity in terms of the moments of the weight distribution and elementary graph motifs. In particular, we explicitly establish a dependency of neural complexity on cyclic graph motifs.

Visualization of Morse connection graphs for topologically rich 2D vector fields.

Science.gov (United States)

Szymczak, Andrzej; Sipeki, Levente

2013-12-01

Recent advances in vector field topologymake it possible to compute its multi-scale graph representations for autonomous 2D vector fields in a robust and efficient manner. One of these representations is a Morse Connection Graph (MCG), a directed graph whose nodes correspond to Morse sets, generalizing stationary points and periodic trajectories, and arcs - to trajectories connecting them. While being useful for simple vector fields, the MCG can be hard to comprehend for topologically rich vector fields, containing a large number of features. This paper describes a visual representation of the MCG, inspired by previous work on graph visualization. Our approach aims to preserve the spatial relationships between the MCG arcs and nodes and highlight the coherent behavior of connecting trajectories. Using simulations of ocean flow, we show that it can provide useful information on the flow structure. This paper focuses specifically on MCGs computed for piecewise constant (PC) vector fields. In particular, we describe extensions of the PC framework that make it more flexible and better suited for analysis of data on complex shaped domains with a boundary. We also describe a topology simplification scheme that makes our MCG visualizations less ambiguous. Despite the focus on the PC framework, our approach could also be applied to graph representations or topological skeletons computed using different methods.

Exponent and scrambling index of double alternate circular snake graphs

Science.gov (United States)

Rahmayanti, Sri; Pasaribu, Valdo E.; Nasution, Sawaluddin; Liani Salnaz, Sishi

2018-01-01

A graph is primitive if it contains a cycle of odd length. The exponent of a primitive graph G, denoted by exp(G), is the smallest positive integer k such that for each pair of vertices u and v in G there is a uv-walk length k. The scrambling index of a primitive graph G, denoted by k(G), is the smallest positive integer k such that for each pair of vertices u and v in G there is a uv-walk of length 2k. For an even positive integer n and an odd positive integer r, a (n,r)-double alternate circular snake graph, denoted by DA(C r,n ), is a graph obtained from a path u 1 u 2 ... u n by replacing each edge of the form u 2i u 2i+1 by two different r-cycles. We study the exponent and scrambling index of DA(C r,n ) and show that exp(DA(C r,n )) = n + r - 4 and k(DA(C r,n )) = (n + r - 3)/2.

Interaction graphs

DEFF Research Database (Denmark)

Seiller, Thomas

2016-01-01

Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

Bayesian centroid estimation for motif discovery.

Science.gov (United States)

Carvalho, Luis

2013-01-01

Biological sequences may contain patterns that signal important biomolecular functions; a classical example is regulation of gene expression by transcription factors that bind to specific patterns in genomic promoter regions. In motif discovery we are given a set of sequences that share a common motif and aim to identify not only the motif composition, but also the binding sites in each sequence of the set. We propose a new centroid estimator that arises from a refined and meaningful loss function for binding site inference. We discuss the main advantages of centroid estimation for motif discovery, including computational convenience, and how its principled derivation offers further insights about the posterior distribution of binding site configurations. We also illustrate, using simulated and real datasets, that the centroid estimator can differ from the traditional maximum a posteriori or maximum likelihood estimators.

Bayesian centroid estimation for motif discovery.

Directory of Open Access Journals (Sweden)

Luis Carvalho

Full Text Available Biological sequences may contain patterns that signal important biomolecular functions; a classical example is regulation of gene expression by transcription factors that bind to specific patterns in genomic promoter regions. In motif discovery we are given a set of sequences that share a common motif and aim to identify not only the motif composition, but also the binding sites in each sequence of the set. We propose a new centroid estimator that arises from a refined and meaningful loss function for binding site inference. We discuss the main advantages of centroid estimation for motif discovery, including computational convenience, and how its principled derivation offers further insights about the posterior distribution of binding site configurations. We also illustrate, using simulated and real datasets, that the centroid estimator can differ from the traditional maximum a posteriori or maximum likelihood estimators.

Quantum walk on a chimera graph

Science.gov (United States)

Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

2018-05-01

We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

A cut locus for finite graphs and the farthest point mapping

DEFF Research Database (Denmark)

Maddaloni, Alessandro; Zamfirescu, Carol T.

2016-01-01

We reflect upon an analogue of the cut locus, a notion classically studied in Differential Geometry, for finite graphs. The cut locus C(x) of a vertex x shall be the graph induced by the set of all vertices y with the property that no shortest path between x and z, z≠y, contains y. The cut locus ...

On some labelings of triangular snake and central graph of triangular snake graph

Science.gov (United States)

Agasthi, P.; Parvathi, N.

2018-04-01

A Triangular snake Tn is obtained from a path u 1 u 2 … u n by joining ui and u i+1 to a new vertex wi for 1≤i≤n‑1. A Central graph of Triangular snake C(T n ) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn . In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.

Graph-theoretical concepts and physicochemical data

Directory of Open Access Journals (Sweden)

Lionello Pogliani

2003-02-01

Full Text Available Graph theoretical concepts have been used to model the molecular polarizabilities of fifty-four organic derivatives, and the induced dipole moment of a set of fifty-seven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen-suppressed chemical graph and pseudograph of a molecule, which works very well for second row atoms. From these types of graphs a set of graph-theoretical basis indices, the molecular connectivity indices, can be derived and used to model properties and activities of molecules. With the aid of the molecular connectivity basis indices it is then possible to build higher-order descriptors. The problem of 'graph' encoding the contribution of the inner-core electrons of heteroatoms can here be solved with the aid of odd complete graphs, Kp-(p-odd. The use of these graph tools allow to draw an optimal modeling of the molecular polarizabilities and a satisfactory modeling of the induced dipole moment of a wide set of organic derivatives.

Schouten identities for Feynman graph amplitudes; The Master Integrals for the two-loop massive sunrise graph

International Nuclear Information System (INIS)

Remiddi, Ettore; Tancredi, Lorenzo

2014-01-01

A new class of identities for Feynman graph amplitudes, dubbed Schouten identities, valid at fixed integer value of the dimension d is proposed. The identities are then used in the case of the two-loop sunrise graph with arbitrary masses for recovering the second-order differential equation for the scalar amplitude in d=2 dimensions, as well as a chained set of equations for all the coefficients of the expansions in (d−2). The shift from d≈2 to d≈4 dimensions is then discussed

Systematic benchmark of substructure search in molecular graphs - From Ullmann to VF2

Directory of Open Access Journals (Sweden)

Ehrlich Hans-Christian

2012-07-01

Full Text Available Abstract Background Searching for substructures in molecules belongs to the most elementary tasks in cheminformatics and is nowadays part of virtually every cheminformatics software. The underlying algorithms, used over several decades, are designed for the application to general graphs. Applied on molecular graphs, little effort has been spend on characterizing their performance. Therefore, it is not clear how current substructure search algorithms behave on such special graphs. One of the main reasons why such an evaluation was not performed in the past was the absence of appropriate data sets. Results In this paper, we present a systematic evaluation of Ullmann’s and the VF2 subgraph isomorphism algorithms on molecular data. The benchmark set consists of a collection of 1235 SMARTS substructure expressions and selected molecules from the ZINC database. The benchmark evaluates substructures search times for complete database scans as well as individual substructure-molecule pairs. In detail, we focus on the influence of substructure formulation and size, the impact of molecule size, and the ability of both algorithms to be used on multiple cores. Conclusions The results show a clear superiority of the VF2 algorithm in all test scenarios. In general, both algorithms solve most instances in less than one millisecond, which we consider to be acceptable. Still, in direct comparison, the VF2 is most often several folds faster than Ullmann’s algorithm. Additionally, Ullmann’s algorithm shows a surprising number of run time outliers.

On the Total Edge Irregularity Strength of Generalized Butterfly Graph

Science.gov (United States)

Dwi Wahyuna, Hafidhyah; Indriati, Diari

2018-04-01

Let G(V, E) be a connected, simple, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, …, k}. An edge irregular total k-labeling λ: V(G) ∪ E(G) → {1, 2, …, k} of a graph G is a total k-labeling such that the weights calculated for all edges are distinct. The weight of an edge uv in G, denoted by wt(uv), is defined as the sum of the label of u, the label of v, and the label of uv. The total edge irregularity strength of G, denoted by tes(G), is the minimum value of the largest label k over all such edge irregular total k-labelings. A generalized butterfly graph, BFn , obtained by inserting vertices to every wing with assumption that sum of inserting vertices to every wing are same then it has 2n + 1 vertices and 4n ‑ 2 edges. In this paper, we investigate the total edge irregularity strength of generalized butterfly graph, BFn , for n > 2. The result is tes(B{F}n)=\\lceil \\frac{4n}{3}\\rceil .

Outer-2-independent domination in graphs

Indian Academy of Sciences (India)

Outer-2-independent domination in graphs. MARCIN KRZYWKOWSKI1,2,∗, DOOST ALI MOJDEH3 and MARYEM RAOOFI4. 1Department of Pure and Applied Mathematics, University of Johannesburg,. Johannesburg, South Africa. 2Faculty of Electronics, Telecommunications and Informatics, Gdansk University.

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

OpenAIRE

Faenza, Y.; Oriolo, G.; Stauffer, G.

2011-01-01

We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n^3)-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also intioduced in the present paper. Despite being weaker than the well-known structure result for claw-free graphs given by Chudnovsky and Seymour, our decomposition theorem is, on the other hand, algorithmic, i.e. it is ...

More progress on tough graphs -- The Y2K report

NARCIS (Netherlands)

Bauer, D.; Broersma, Haitze J.; Schmeichel, E.

2000-01-01

We now know that not every $2$-tough graph is hamiltonian. In fact for every $\\epsilon > 0$, there exists a ($9/4 - \\epsilon$) - tough nontraceable graph. We continue our quadrennial survey of results that relate the toughness of a graph to its cycle structure.

L(2, 1-Labelings of Some Families of Oriented Planar Graphs

Directory of Open Access Journals (Sweden)

Sen Sagnik

2014-02-01

Full Text Available In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.

Distance-transitive graphs

NARCIS (Netherlands)

Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.

2004-01-01

In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite

Powdery mildew fungal effector candidates share N-terminal Y/F/WxC-motif

Directory of Open Access Journals (Sweden)

Emmersen Jeppe

2010-05-01

Full Text Available Abstract Background Powdery mildew and rust fungi are widespread, serious pathogens that depend on developing haustoria in the living plant cells. Haustoria are separated from the host cytoplasm by a plant cell-derived extrahaustorial membrane. They secrete effector proteins, some of which are subsequently transferred across this membrane to the plant cell to suppress defense. Results In a cDNA library from barley epidermis containing powdery mildew haustoria, two-thirds of the sequenced ESTs were fungal and represented ~3,000 genes. Many of the most highly expressed genes encoded small proteins with N-terminal signal peptides. While these proteins are novel and poorly related, they do share a three-amino acid motif, which we named "Y/F/WxC", in the N-terminal of the mature proteins. The first amino acid of this motif is aromatic: tyrosine, phenylalanine or tryptophan, and the last is always cysteine. In total, we identified 107 such proteins, for which the ESTs represent 19% of the fungal clones in our library, suggesting fundamental roles in haustoria function. While overall sequence similarity between the powdery mildew Y/F/WxC-proteins is low, they do have a highly similar exon-intron structure, suggesting they have a common origin. Interestingly, searches of public fungal genome and EST databases revealed that haustoria-producing rust fungi also encode large numbers of novel, short proteins with signal peptides and the Y/F/WxC-motif. No significant numbers of such proteins were identified from genome and EST sequences from either fungi which do not produce haustoria or from haustoria-producing Oomycetes. Conclusion In total, we identified 107, 178 and 57 such Y/F/WxC-proteins from the barley powdery mildew, the wheat stem rust and the wheat leaf rust fungi, respectively. All together, our findings suggest the Y/F/WxC-proteins to be a new class of effectors from haustoria-producing pathogenic fungi.

Lower bounds on the independence number of certain graphs of odd girth at least seven

DEFF Research Database (Denmark)

Pedersen, A. S.; Rautenbach, D.; Regen, F.

2011-01-01

Heckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triangle-free cubic graphs, Discrete Math. 233 (2001) 233-237] proved that every connected subcubic triangle-free graph G has an independent set of order at least (4n(G) - m(G) - 1)/7 where n(G) and m(G) denote...

GraphTeams: a method for discovering spatial gene clusters in Hi-C sequencing data.

Science.gov (United States)

Schulz, Tizian; Stoye, Jens; Doerr, Daniel

2018-05-08

Hi-C sequencing offers novel, cost-effective means to study the spatial conformation of chromosomes. We use data obtained from Hi-C experiments to provide new evidence for the existence of spatial gene clusters. These are sets of genes with associated functionality that exhibit close proximity to each other in the spatial conformation of chromosomes across several related species. We present the first gene cluster model capable of handling spatial data. Our model generalizes a popular computational model for gene cluster prediction, called δ-teams, from sequences to graphs. Following previous lines of research, we subsequently extend our model to allow for several vertices being associated with the same label. The model, called δ-teams with families, is particular suitable for our application as it enables handling of gene duplicates. We develop algorithmic solutions for both models. We implemented the algorithm for discovering δ-teams with families and integrated it into a fully automated workflow for discovering gene clusters in Hi-C data, called GraphTeams. We applied it to human and mouse data to find intra- and interchromosomal gene cluster candidates. The results include intrachromosomal clusters that seem to exhibit a closer proximity in space than on their chromosomal DNA sequence. We further discovered interchromosomal gene clusters that contain genes from different chromosomes within the human genome, but are located on a single chromosome in mouse. By identifying δ-teams with families, we provide a flexible model to discover gene cluster candidates in Hi-C data. Our analysis of Hi-C data from human and mouse reveals several known gene clusters (thus validating our approach), but also few sparsely studied or possibly unknown gene cluster candidates that could be the source of further experimental investigations.

A characterization of graphs with disjoint dominating and total ...

African Journals Online (AJOL)

A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. In this paper, we provide a constructive characterization of graphs whose vertex set can be ...

The paired-domination and the upper paired-domination numbers of graphs

Directory of Open Access Journals (Sweden)

Włodzimierz Ulatowski

2015-01-01

Full Text Available In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph \\(G\\ with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of \\(G\\, denoted by \\(\\gamma_{p}(G\\, is the minimum cardinality of a PDS of \\(G\\. The upper paired-domination number of \\(G\\, denoted by \\(\\Gamma_{p}(G\\, is the maximum cardinality of a minimal PDS of \\(G\\. Let \\(G\\ be a connected graph of order \\(n\\geq 3\\. Haynes and Slater in [Paired-domination in graphs, Networks 32 (1998, 199-206], showed that \\(\\gamma_{p}(G\\leq n-1\\ and they determine the extremal graphs \\(G\\ achieving this bound. In this paper we obtain analogous results for \\(\\Gamma_{p}(G\\. Dorbec, Henning and McCoy in [Upper total domination versus upper paired-domination, Questiones Mathematicae 30 (2007, 1-12] determine \\(\\Gamma_{p}(P_n\\, instead in this paper we determine \\(\\Gamma_{p}(C_n\\. Moreover, we describe some families of graphs \\(G\\ for which the equality \\(\\gamma_{p}(G=\\Gamma_{p}(G\\ holds.

Simplicial complexes of graphs

CERN Document Server

Jonsson, Jakob

2008-01-01

A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

Corticotropin-Releasing Hormone Receptor Type 1 (CRHR1 Clustering with MAGUKs Is Mediated via Its C-Terminal PDZ Binding Motif.

Directory of Open Access Journals (Sweden)

Julia Bender

Full Text Available The corticotropin-releasing hormone receptor type 1 (CRHR1 plays an important role in orchestrating neuroendocrine, behavioral, and autonomic responses to stress. To identify molecules capable of directly modulating CRHR1 signaling, we performed a yeast-two-hybrid screen using the C-terminal intracellular tail of the receptor as bait. We identified several members of the membrane-associated guanylate kinase (MAGUK family: postsynaptic density protein 95 (PSD95, synapse-associated protein 97 (SAP97, SAP102 and membrane associated guanylate kinase, WW and PDZ domain containing 2 (MAGI2. CRHR1 is co-expressed with the identified MAGUKs and with the additionally investigated PSD93 in neurons of the adult mouse brain and in primary hippocampal neurons, supporting the probability of a physiological interaction in vivo. The C-terminal PDZ (PSD-95, discs large, zona occludens 1 binding motif of CRHR1 is essential for its physical interaction with MAGUKs, as revealed by the CRHR1-STAVA mutant, which harbors a functionally impaired PDZ binding motif. The imitation of a phosphorylation at Thr413 within the PDZ binding motif also disrupted the interaction with MAGUKs. In contrast, distinct PDZ domains within the identified MAGUKs are involved in the interactions. Expression of CRHR1 in primary neurons demonstrated its localization throughout the neuronal plasma membrane, including the excitatory post synapse, where the receptor co-localized with PSD95 and SAP97. The co-expression of CRHR1 and respective interacting MAGUKs in HEK293 cells resulted in a clustered subcellular co-localization which required an intact PDZ binding motif. In conclusion, our study characterized the PDZ binding motif-mediated interaction of CRHR1 with multiple MAGUKs, which directly affects receptor function.

Strategy and pattern recognition in expert\\ud comprehension of 2 × 2 interaction graphs

OpenAIRE

Peebles, David

2013-01-01

I present a model of expert comprehension performance for 2 × 2 "interaction" graphs typically used to present data from two-way factorial research designs. Developed using the ACT-R cognitive architecture, the model simulates the cognitive and perceptual operations involved in interpreting interaction graphs and provides a detailed characterisation of the information\\ud extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated durin...

A conserved WW domain-like motif regulates invariant chain-dependent cell-surface transport of the NKG2D ligand ULBP2

DEFF Research Database (Denmark)

Uhlenbrock, Franziska Katharina; van Andel, Esther; Andresen, Lars

2015-01-01

that the NKG2D ligand ULBP2 traffics over an invariant chain (Ii)-dependent pathway to the cell surface. This study set out to elucidate how Ii regulates ULBP2 cell-surface transport: We discovered conserved tryptophan (Trp) residues in the primary protein sequence of ULBP1-6 but not in the related MICA....../B. Substitution of Trp to alanine resulted in cell-surface inhibition of ULBP2 in different cancer cell lines. Moreover, the mutated ULBP2 constructs were retained and not degraded inside the cell, indicating a crucial role of this conserved Trp-motif in trafficking. Finally, overexpression of Ii increased...... surface expression of wt ULBP2 while Trp-mutants could not be expressed, proposing that this Trp-motif is required for an Ii-dependent cell-surface transport of ULBP2. Aberrant soluble ULBP2 is immunosuppressive. Thus, targeting a distinct protein module on the ULBP2 sequence could counteract...

Connected feedback vertex set in planar graphs

NARCIS (Netherlands)

Grigoriev, Alexander; Sitters, René

2010-01-01

We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present a polynomial time approximation scheme for both the connected and unconnected

Cospectral Graphs and Regular Orthogonal Matrices of Level 2

NARCIS (Netherlands)

Abiad Monge, A.; Haemers, W.H.

2012-01-01

Abstract: For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into a graph Γ' with adjacency matrix A', defined by A' = QtAQ, where Q is a regular orthogonal matrix of level 2 (that is, QtQ = I, Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an

Cospectral graphs and regular orthogonal matrices of level 2

NARCIS (Netherlands)

Abiad Monge, A.; Haemers, W.H.

2012-01-01

For a graph Γ with adjacency matrix A , we consider a switching operation that takes Γ into a graph Γ′ with adjacency matrix A′ , defined by A′ = Q⊤AQ , where Q is a regular orthogonal matrix of level 2 (that is, Q⊤Q=I , Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an

Large-scale discovery of promoter motifs in Drosophila melanogaster.

Directory of Open Access Journals (Sweden)

Thomas A Down

2007-01-01

Full Text Available A key step in understanding gene regulation is to identify the repertoire of transcription factor binding motifs (TFBMs that form the building blocks of promoters and other regulatory elements. Identifying these experimentally is very laborious, and the number of TFBMs discovered remains relatively small, especially when compared with the hundreds of transcription factor genes predicted in metazoan genomes. We have used a recently developed statistical motif discovery approach, NestedMICA, to detect candidate TFBMs from a large set of Drosophila melanogaster promoter regions. Of the 120 motifs inferred in our initial analysis, 25 were statistically significant matches to previously reported motifs, while 87 appeared to be novel. Analysis of sequence conservation and motif positioning suggested that the great majority of these discovered motifs are predictive of functional elements in the genome. Many motifs showed associations with specific patterns of gene expression in the D. melanogaster embryo, and we were able to obtain confident annotation of expression patterns for 25 of our motifs, including eight of the novel motifs. The motifs are available through Tiffin, a new database of DNA sequence motifs. We have discovered many new motifs that are overrepresented in D. melanogaster promoter regions, and offer several independent lines of evidence that these are novel TFBMs. Our motif dictionary provides a solid foundation for further investigation of regulatory elements in Drosophila, and demonstrates techniques that should be applicable in other species. We suggest that further improvements in computational motif discovery should narrow the gap between the set of known motifs and the total number of transcription factors in metazoan genomes.

An Association-Oriented Partitioning Approach for Streaming Graph Query

Directory of Open Access Journals (Sweden)

Yun Hao

2017-01-01

Full Text Available The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role. Regarding graph query, a well-designed partitioning method is essential for achieving better performance. Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing. In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc. This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm. After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined. Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided. We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach. The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

Science.gov (United States)

Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

2013-02-01

Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

Selection of functional 2A sequences within foot-and-mouth disease virus; requirements for the NPGP motif with a distinct codon bias.

Science.gov (United States)

Kjær, Jonas; Belsham, Graham J

2018-01-01

Foot-and-mouth disease virus (FMDV) has a positive-sense ssRNA genome including a single, large, open reading frame. Splitting of the encoded polyprotein at the 2A/2B junction is mediated by the 2A peptide (18 residues long), which induces a nonproteolytic, cotranslational "cleavage" at its own C terminus. A conserved feature among variants of 2A is the C-terminal motif N 16 P 17 G 18 /P 19 , where P 19 is the first residue of 2B. It has been shown previously that certain amino acid substitutions can be tolerated at residues E 14 , S 15 , and N 16 within the 2A sequence of infectious FMDVs, but no variants at residues P 17 , G 18 , or P 19 have been identified. In this study, using highly degenerate primers, we analyzed if any other residues can be present at each position of the NPG/P motif within infectious FMDV. No alternative forms of this motif were found to be encoded by rescued FMDVs after two, three, or four passages. However, surprisingly, a clear codon preference for the wt nucleotide sequence encoding the NPGP motif within these viruses was observed. Indeed, the codons selected to code for P 17 and P 19 within this motif were distinct; thus the synonymous codons are not equivalent. © 2018 Kjær and Belsham; Published by Cold Spring Harbor Laboratory Press for the RNA Society.

Comparative analysis of evolutionarily conserved motifs of epidermal growth factor receptor 2 (HER2) predicts novel potential therapeutic epitopes

DEFF Research Database (Denmark)

Deng, Xiaohong; Zheng, Xuxu; Yang, Huanming

2014-01-01

druggable epitopes/targets. We employed the PROSITE Scan to detect structurally conserved motifs and PRINTS to search for linearly conserved motifs of ECD HER2. We found that the epitopes recognized by trastuzumab and pertuzumab are located in the predicted conserved motifs of ECD HER2, supporting our...

cWords - systematic microRNA regulatory motif discovery from mRNA expression data

DEFF Research Database (Denmark)

Rasmussen, Simon Horskjær; Jacobsen, Anders; Krogh, Anders

2013-01-01

and statistical methods of cWords, resulting in at least a factor 100 speed gain over the previous implementation. On a benchmark dataset of 19 microRNA (miRNA) perturbation experiments cWords showed equal or better performance than two comparable methods, miReduce and Sylamer. We have developed rigorous motif...... that demonstrate comparable or better performance than other existing methods. Rich visualization of results promotes intuitive and efficient interpretation of data. cWords is available as a stand-alone Open Source program at Github https://github.com/simras/cWords webcite and as a web-service at: http...

Graph Transforming Java Data

NARCIS (Netherlands)

de Mol, M.J.; Rensink, Arend; Hunt, James J.

This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class

On a Fuzzy Algebra for Querying Graph Databases

OpenAIRE

Pivert , Olivier; Thion , Virginie; Jaudoin , Hélène; Smits , Grégory

2014-01-01

International audience; This paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra that makes it possible to handle such database, which may be fuzzy or not, in a flexible way. The algebra, based on fuzzy set theory and the concept of a fuzzy graph, is composed of a set of operators that can be used to express preference queries on fuzzy graph databases. The preferences concern i) the content of the vertices of the graph and ii) the structure of the graph. In a s...

New PAH gene promoter KLF1 and 3'-region C/EBPalpha motifs influence transcription in vitro.

Science.gov (United States)

Klaassen, Kristel; Stankovic, Biljana; Kotur, Nikola; Djordjevic, Maja; Zukic, Branka; Nikcevic, Gordana; Ugrin, Milena; Spasovski, Vesna; Srzentic, Sanja; Pavlovic, Sonja; Stojiljkovic, Maja

2017-02-01

Phenylketonuria (PKU) is a metabolic disease caused by mutations in the phenylalanine hydroxylase (PAH) gene. Although the PAH genotype remains the main determinant of PKU phenotype severity, genotype-phenotype inconsistencies have been reported. In this study, we focused on unanalysed sequences in non-coding PAH gene regions to assess their possible influence on the PKU phenotype. We transiently transfected HepG2 cells with various chloramphenicol acetyl transferase (CAT) reporter constructs which included PAH gene non-coding regions. Selected non-coding regions were indicated by in silico prediction to contain transcription factor binding sites. Furthermore, electrophoretic mobility shift assay (EMSA) and supershift assays were performed to identify which transcriptional factors were engaged in the interaction. We found novel KLF1 motif in the PAH promoter, which decreases CAT activity by 50 % in comparison to basal transcription in vitro. The cytosine at the c.-170 promoter position creates an additional binding site for the protein complex involving KLF1 transcription factor. Moreover, we assessed for the first time the role of a multivariant variable number tandem repeat (VNTR) region located in the 3'-region of the PAH gene. We found that the VNTR3, VNTR7 and VNTR8 constructs had approximately 60 % of CAT activity. The regulation is mediated by the C/EBPalpha transcription factor, present in protein complex binding to VNTR3. Our study highlighted two novel promoter KLF1 and 3'-region C/EBPalpha motifs in the PAH gene which decrease transcription in vitro and, thus, could be considered as PAH expression modifiers. New transcription motifs in non-coding regions will contribute to better understanding of the PKU phenotype complexity and may become important for the optimisation of PKU treatment.

Coloring geographical threshold graphs

Energy Technology Data Exchange (ETDEWEB)

Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH

2008-01-01

We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.

Motif enrichment tool.

Science.gov (United States)

Blatti, Charles; Sinha, Saurabh

2014-07-01

The Motif Enrichment Tool (MET) provides an online interface that enables users to find major transcriptional regulators of their gene sets of interest. MET searches the appropriate regulatory region around each gene and identifies which transcription factor DNA-binding specificities (motifs) are statistically overrepresented. Motif enrichment analysis is currently available for many metazoan species including human, mouse, fruit fly, planaria and flowering plants. MET also leverages high-throughput experimental data such as ChIP-seq and DNase-seq from ENCODE and ModENCODE to identify the regulatory targets of a transcription factor with greater precision. The results from MET are produced in real time and are linked to a genome browser for easy follow-up analysis. Use of the web tool is free and open to all, and there is no login requirement. ADDRESS: http://veda.cs.uiuc.edu/MET/. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Role of the Box C/D Motif in Localization of Small Nucleolar RNAs to Coiled Bodies and Nucleoli

Science.gov (United States)

Narayanan, Aarthi; Speckmann, Wayne; Terns, Rebecca; Terns, Michael P.

1999-01-01

Small nucleolar RNAs (snoRNAs) are a large family of eukaryotic RNAs that function within the nucleolus in the biogenesis of ribosomes. One major class of snoRNAs is the box C/D snoRNAs named for their conserved box C and box D sequence elements. We have investigated the involvement of cis-acting sequences and intranuclear structures in the localization of box C/D snoRNAs to the nucleolus by assaying the intranuclear distribution of fluorescently labeled U3, U8, and U14 snoRNAs injected into Xenopus oocyte nuclei. Analysis of an extensive panel of U3 RNA variants showed that the box C/D motif, comprised of box C′, box D, and the 3′ terminal stem of U3, is necessary and sufficient for the nucleolar localization of U3 snoRNA. Disruption of the elements of the box C/D motif of U8 and U14 snoRNAs also prevented nucleolar localization, indicating that all box C/D snoRNAs use a common nucleolar-targeting mechanism. Finally, we found that wild-type box C/D snoRNAs transiently associate with coiled bodies before they localize to nucleoli and that variant RNAs that lack an intact box C/D motif are detained within coiled bodies. These results suggest that coiled bodies play a role in the biogenesis and/or intranuclear transport of box C/D snoRNAs. PMID:10397754

Graph Mining Meets the Semantic Web

Energy Technology Data Exchange (ETDEWEB)

Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

2015-01-01

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

Capillary arterialization requires the bone-marrow-derived cell (BMC)-specific expression of chemokine (C-C motif) receptor-2, but BMCs do not transdifferentiate into microvascular smooth muscle.

Science.gov (United States)

Nickerson, Meghan M; Burke, Caitlin W; Meisner, Joshua K; Shuptrine, Casey W; Song, Ji; Price, Richard J

2009-01-01

Chemokine (C-C motif) receptor-2 (CCR2) regulates arteriogenesis and angiogenesis, facilitating the MCP-1-dependent recruitment of growth factor-secreting bone marrow-derived cells (BMCs). Here, we tested the hypothesis that the BMC-specific expression of CCR2 is also required for new arteriole formation via capillary arterialization. Following non-ischemic saphenous artery occlusion, we measured the following in gracilis muscles: monocyte chemotactic protein-1 (MCP-1) in wild-type (WT) C57Bl/6J mice by ELISA, and capillary arterialization in WT-WT and CCR2(-/-)-WT (donor-host) bone marrow chimeric mice, as well as BMC transdifferentiation in EGFP(+)-WT mice, by smooth muscle (SM) alpha-actin immunochemistry. MCP-1 levels were significantly elevated 1 day after occlusion in WT mice. In WT-WT mice at day 7, compared to sham controls, arterial occlusion induced a 34% increase in arteriole length density, a 46% increase in SM alpha-actin(+) vessels, and a 45% increase in the fraction of vessels coated with SM alpha-actin, indicating significant capillary arterialization. However, in CCR2(-/-)-WT mice, no differences were observed between arterial occlusion and sham surgery. In EGFP(+)-WT mice, EGFP and SM alpha-actin never colocalized. We conclude that BMC-specific CCR2 expression is required for skeletal muscle capillary arterialization following arterial occlusion; however, BMCs do not transdifferentiate into smooth muscle.

Selection of functional 2A sequences within foot-and-mouth disease virus; requirements for the NPGP motif with a distinct codon bias

DEFF Research Database (Denmark)

Kjær, Jonas; Belsham, Graham J.

2018-01-01

Foot-and-mouth disease virus (FMDV) has a positive-sense ssRNA genome including a single, large, open reading frame. Splitting of the encoded polyprotein at the 2A/2B junction is mediated by the 2A peptide (18 residues long) which induces a non-proteolytic, co-translational, "cleavage" at its own C......-terminus. A conserved feature among variants of 2A is the C-terminal motif N16P17G18/P19 where P19 is the first residue of 2B. It has been shown previously that certain amino acid substitutions can be tolerated at residues E14, S15 and N16 within the 2A sequence of infectious FMDVs but no variants at residues P17, G18...... or P19 have been identified. In this study, using highly degenerate primers, we analysed if any other residues can be present at each position of the NPG/P motif within infectious FMDV. No alternative forms of this motif were found to be encoded by rescued FMDVs after 2, 3 or 4 passages. However...

Crystal structure and novel recognition motif of rho ADP-ribosylating C3 exoenzyme from Clostridium botulinum: structural insights for recognition specificity and catalysis.

Science.gov (United States)

Han, S; Arvai, A S; Clancy, S B; Tainer, J A

2001-01-05

Clostridium botulinum C3 exoenzyme inactivates the small GTP-binding protein family Rho by ADP-ribosylating asparagine 41, which depolymerizes the actin cytoskeleton. C3 thus represents a major family of the bacterial toxins that transfer the ADP-ribose moiety of NAD to specific amino acids in acceptor proteins to modify key biological activities in eukaryotic cells, including protein synthesis, differentiation, transformation, and intracellular signaling. The 1.7 A resolution C3 exoenzyme structure establishes the conserved features of the core NAD-binding beta-sandwich fold with other ADP-ribosylating toxins despite little sequence conservation. Importantly, the central core of the C3 exoenzyme structure is distinguished by the absence of an active site loop observed in many other ADP-ribosylating toxins. Unlike the ADP-ribosylating toxins that possess the active site loop near the central core, the C3 exoenzyme replaces the active site loop with an alpha-helix, alpha3. Moreover, structural and sequence similarities with the catalytic domain of vegetative insecticidal protein 2 (VIP2), an actin ADP-ribosyltransferase, unexpectedly implicates two adjacent, protruding turns, which join beta5 and beta6 of the toxin core fold, as a novel recognition specificity motif for this newly defined toxin family. Turn 1 evidently positions the solvent-exposed, aromatic side-chain of Phe209 to interact with the hydrophobic region of Rho adjacent to its GTP-binding site. Turn 2 evidently both places the Gln212 side-chain for hydrogen bonding to recognize Rho Asn41 for nucleophilic attack on the anomeric carbon of NAD ribose and holds the key Glu214 catalytic side-chain in the adjacent catalytic pocket. This proposed bipartite ADP-ribosylating toxin turn-turn (ARTT) motif places the VIP2 and C3 toxin classes into a single ARTT family characterized by analogous target protein recognition via turn 1 aromatic and turn 2 hydrogen-bonding side-chain moieties. Turn 2 centrally anchors

Analysis of a conserved RGE/RGD motif in HCV E2 in mediating entry

Directory of Open Access Journals (Sweden)

Rong Lijun

2009-01-01

Full Text Available Abstract Background Hepatitis C virus (HCV encodes two transmembrane glycoproteins E1 and E2 which form a heterodimer. E1 is believed to mediate fusion while E2 has been shown to bind cellular receptors. It is clear that HCV uses a multi-receptor complex to gain entry into susceptible cells, however key elements of this complex remain elusive. In this study, the role of a highly conserved RGE/RGD motif of HCV E2 glycoprotein in viral entry was examined. The effect of each substitution mutation in this motif was tested by challenging susceptible cell lines with mutant HCV E1E2 pseudotyped viruses generated using a lentiviral system (HCVpp. In addition to assaying infectivity, producer cell expression and HCVpp incorporation of HCV E2 proteins, CD81 binding profiles, and conformation of mutants were examined. Results Based on these characteristics, mutants either displayed wt characteristics (high infectivity [≥ 90% of wt HCVpp], CD81 binding, E1E2 expression, and incorporation into viral particles and proper conformation or very low infectivity (≤ 20% of wt HCVpp. Only amino acid substitutions of the 3rd position (D or E resulted in wt characteristics as long as the negative charge was maintained or a neutral alanine was introduced. A change in charge to a positive lysine, disrupted HCVpp infectivity at this position. Conclusion Although most amino acid substitutions within this conserved motif displayed greatly reduced HCVpp infectivity, they retained soluble CD81 binding, proper E2 conformation, and incorporation into HCVpp. Our results suggest that although RGE/D is a well-defined integrin binding motif, in this case the role of these three hyperconserved amino acids does not appear to be integrin binding. As the extent of conservation of this region extends well beyond these three amino acids, we speculate that this region may play an important role in the structure of HCV E2 or in mediating the interaction with other factor(s during

Disparate requirements for the Walker A and B ATPase motifs ofhuman RAD51D in homologous recombination

Energy Technology Data Exchange (ETDEWEB)

Wiese, Claudia; Hinz, John M.; Tebbs, Robert S.; Nham, Peter B.; Urbin, Salustra S.; Collins, David W.; Thompson, Larry H.; Schild, David

2006-04-21

In vertebrates, homologous recombinational repair (HRR) requires RAD51 and five RAD51 paralogs (XRCC2, XRCC3, RAD51B, RAD51C, and RAD51D) that all contain conserved Walker A and B ATPase motifs. In human RAD51D we examined the requirement for these motifs in interactions with XRCC2 and RAD51C, and for survival of cells in response to DNA interstrand crosslinks. Ectopic expression of wild type human RAD51D or mutants having a non-functional A or B motif was used to test for complementation of a rad51d knockout hamster CHO cell line. Although A-motif mutants complement very efficiently, B-motif mutants do not. Consistent with these results, experiments using the yeast two- and three-hybrid systems show that the interactions between RAD51D and its XRCC2 and RAD51C partners also require a functional RAD51D B motif, but not motif A. Similarly, hamster Xrcc2 is unable to bind to the non-complementing human RAD51D B-motif mutants in co-immunoprecipitation assays. We conclude that a functional Walker B motif, but not A motif, is necessary for RAD51D's interactions with other paralogs and for efficient HRR. We present a model in which ATPase sites are formed in a bipartite manner between RAD51D and other RAD51 paralogs.

Efficient farnesylation of an extended C-terminal C(x)3X sequence motif expands the scope of the prenylated proteome.

Science.gov (United States)

Blanden, Melanie J; Suazo, Kiall F; Hildebrandt, Emily R; Hardgrove, Daniel S; Patel, Meet; Saunders, William P; Distefano, Mark D; Schmidt, Walter K; Hougland, James L

2018-02-23

Protein prenylation is a post-translational modification that has been most commonly associated with enabling protein trafficking to and interaction with cellular membranes. In this process, an isoprenoid group is attached to a cysteine near the C terminus of a substrate protein by protein farnesyltransferase (FTase) or protein geranylgeranyltransferase type I or II (GGTase-I and GGTase-II). FTase and GGTase-I have long been proposed to specifically recognize a four-amino acid C AAX C-terminal sequence within their substrates. Surprisingly, genetic screening reveals that yeast FTase can modify sequences longer than the canonical C AAX sequence, specifically C( x ) 3 X sequences with four amino acids downstream of the cysteine. Biochemical and cell-based studies using both peptide and protein substrates reveal that mammalian FTase orthologs can also prenylate C( x ) 3 X sequences. As the search to identify physiologically relevant C( x ) 3 X proteins begins, this new prenylation motif nearly doubles the number of proteins within the yeast and human proteomes that can be explored as potential FTase substrates. This work expands our understanding of prenylation's impact within the proteome, establishes the biologically relevant reactivity possible with this new motif, and opens new frontiers in determining the impact of non-canonically prenylated proteins on cell function. © 2018 by The American Society for Biochemistry and Molecular Biology, Inc.

Gems of combinatorial optimization and graph algorithms

CERN Document Server

Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea

2015-01-01

Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory?  Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar?  Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science?   Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas.  Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.   This ...

Sparse geometric graphs with small dilation

NARCIS (Netherlands)

Aronov, B.; Berg, de M.; Cheong, O.; Gudmundsson, J.; Haverkort, H.J.; Vigneron, A.; Deng, X.; Du, D.

2005-01-01

Given a set S of n points in the plane, and an integer k such that 0 = k graph with vertex set S, at most n – 1 + k edges, and dilation O(n / (k + 1)) can be computed in time O(n log n). We also construct n–point sets for which any geometric graph with n – 1 + k edges

DMINDA: an integrated web server for DNA motif identification and analyses.

Science.gov (United States)

Ma, Qin; Zhang, Hanyuan; Mao, Xizeng; Zhou, Chuan; Liu, Bingqiang; Chen, Xin; Xu, Ying

2014-07-01

DMINDA (DNA motif identification and analyses) is an integrated web server for DNA motif identification and analyses, which is accessible at http://csbl.bmb.uga.edu/DMINDA/. This web site is freely available to all users and there is no login requirement. This server provides a suite of cis-regulatory motif analysis functions on DNA sequences, which are important to elucidation of the mechanisms of transcriptional regulation: (i) de novo motif finding for a given set of promoter sequences along with statistical scores for the predicted motifs derived based on information extracted from a control set, (ii) scanning motif instances of a query motif in provided genomic sequences, (iii) motif comparison and clustering of identified motifs, and (iv) co-occurrence analyses of query motifs in given promoter sequences. The server is powered by a backend computer cluster with over 150 computing nodes, and is particularly useful for motif prediction and analyses in prokaryotic genomes. We believe that DMINDA, as a new and comprehensive web server for cis-regulatory motif finding and analyses, will benefit the genomic research community in general and prokaryotic genome researchers in particular. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Interaction of Cu+ with cytosine and formation of i-motif-like C-M+-C complexes: alkali versus coinage metals

NARCIS (Netherlands)

Gao, J.; Berden, G.; Rodgers, M.T.; Oomens, J.

2016-01-01

The Watson-Crick structure of DNA is among the most well-known molecular structures of our time. However, alternative base-pairing motifs are also known to occur, often depending on base sequence, pH, or the presence of cations. Pairing of cytosine (C) bases induced by the sharing of a single proton

Graphs cospectral with a friendship graph or its complement

Directory of Open Access Journals (Sweden)

Alireza Abdollahi

2013-12-01

Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

Dicyclo-hexyl-ammonium 3,5-dinitro-benzoate.

Science.gov (United States)

Saeed, Sohail; Rashid, Naghmana; Hussain, Rizwan; Wong, Wing-Tak

2012-07-01

The asymmetric unit of the title salt, C(12)H(24)N(+)·C(7)H(3)N(2)O(6) (-), contains two cations and two anions. In the crystal, the cations and anions are connected by N-H⋯O hydrogen bonds, forming a 12-membered ring with an R(4) (4)(12) graph-set motif. The center of this 12-membered ring coincides with an inversion centre. π-π stacking is observed between parallel benzene rings [centroid-centriod distance = 3.771 (2) Å].

Dicyclohexylammonium 3,5-dinitrobenzoate

OpenAIRE

Sohail Saeed; Naghmana Rashid; Rizwan Hussain; Wing-Tak Wong

2012-01-01

The asymmetric unit of the title salt, C12H24N+·C7H3N2O6−, contains two cations and two anions. In the crystal, the cations and anions are connected by N—H...O hydrogen bonds, forming a 12-membered ring with an R44(12) graph-set motif. The center of this 12-membered ring coincides with an inversion centre. π–π stacking is observed between parallel benzene rings [centroid–centriod distance = 3.771 (2) &#...

Role of the ERC motif in the proximal part of the second intracellular loop and the C-terminal domain of the human prostaglandin F2alpha receptor (hFP-R) in G-protein coupling control.

Science.gov (United States)

Pathe-Neuschäfer-Rube, Andrea; Neuschäfer-Rube, Frank; Püschel, Gerhard P

2005-05-15

The human FP-R (F2alpha prostaglandin receptor) is a Gq-coupled heptahelical ectoreceptor, which is of significant medical interest, since it is a potential target for the treatment of glaucoma and preterm labour. On agonist exposure, it mediates an increase in intracellular inositol phosphate formation. Little is known about the structures that govern the agonist-dependent receptor activation. In other prostanoid receptors, the C-terminal domain has been inferred in the control of agonist-dependent receptor activation. A DRY motif at the beginning of the second intracellular loop is highly conserved throughout the G-protein-coupled receptor family and appears to be crucial for controlling agonist-dependent receptor activation. It is replaced by an ERC motif in the FP-R and no evidence for the relevance of this motif in ligand-dependent activation of prostanoid receptors has been provided so far. The aim of the present study was to elucidate the potential role of the C-terminal domain and the ERC motif in agonist-controlled intracellular signalling in FP-R mutants generated by site-directed mutagenesis. It was found that substitution of the acidic Glu(132) in the ERC motif by a threonine residue led to full constitutive activation, whereas truncation of the receptor's C-terminal domain led to partial constitutive activation of all three intracellular signal pathways that had previously been shown to be activated by the FP-R, i.e. inositol trisphosphate formation, focal adhesion kinase activation and T-cell factor signalling. Inositol trisphosphate formation and focal adhesion kinase phosphorylation were further enhanced by ligand binding in cells expressing the truncation mutant but not the E132T (Glu132-->Thr) mutant. Thus C-terminal truncation appeared to result in a receptor with partial constitutive activation, whereas substitution of Glu132 by threonine apparently resulted in a receptor with full constitutive activity.

Sampling Large Graphs for Anticipatory Analytics

Science.gov (United States)

2015-05-15

low. C. Random Area Sampling Random area sampling [8] is a “ snowball ” sampling method in which a set of random seed vertices are selected and areas... Sampling Large Graphs for Anticipatory Analytics Lauren Edwards, Luke Johnson, Maja Milosavljevic, Vijay Gadepally, Benjamin A. Miller Lincoln...systems, greater human-in-the-loop involvement, or through complex algorithms. We are investigating the use of sampling to mitigate these challenges

Practical graph mining with R

CERN Document Server

Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan

2014-01-01

Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...

Triangle-free graphs whose independence number equals the degree

DEFF Research Database (Denmark)

Brandt, Stephan

2010-01-01

In a triangle-free graph, the neighbourhood of every vertex is an independent set. We investigate the class S of triangle-free graphs where the neighbourhoods of vertices are maximum independent sets. Such a graph G must be regular of degree d = α (G) and the fractional chromatic number must sati...

Inferring ontology graph structures using OWL reasoning

KAUST Repository

Rodriguez-Garcia, Miguel Angel

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

Inferring ontology graph structures using OWL reasoning.

Science.gov (United States)

Rodríguez-García, Miguel Ángel; Hoehndorf, Robert

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

Dysregulation of C-X-C motif ligand 10 during aging and association with cognitive performance.

Science.gov (United States)

Bradburn, Steven; McPhee, Jamie; Bagley, Liam; Carroll, Michael; Slevin, Mark; Al-Shanti, Nasser; Barnouin, Yoann; Hogrel, Jean-Yves; Pääsuke, Mati; Gapeyeva, Helena; Maier, Andrea; Sipilä, Sarianna; Narici, Marco; Robinson, Andrew; Mann, David; Payton, Antony; Pendleton, Neil; Butler-Browne, Gillian; Murgatroyd, Chris

2018-03-01

Chronic low-grade inflammation during aging (inflammaging) is associated with cognitive decline and neurodegeneration; however, the mechanisms underlying inflammaging are unclear. We studied a population (n = 361) of healthy young and old adults from the MyoAge cohort. Peripheral levels of C-X-C motif chemokine ligand 10 (CXCL10) was found to be higher in older adults, compared with young, and negatively associated with working memory performance. This coincided with an age-related reduction in blood DNA methylation at specific CpGs within the CXCL10 gene promoter. In vitro analysis supported the role of DNA methylation in regulating CXCL10 transcription. A polymorphism (rs56061981) that altered methylation at one of these CpG sites further associated with working memory performance in 2 independent aging cohorts. Studying prefrontal cortex samples, we found higher CXCL10 protein levels in those with Alzheimer's disease, compared with aged controls. These findings support the association of peripheral inflammation, as demonstrated by CXCL10, in aging and cognitive decline. We reveal age-related epigenetic and genetic factors which contribute to the dysregulation of CXCL10. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

Review article: The mountain motif in the plot of Matthew

Directory of Open Access Journals (Sweden)

Gert J. Volschenk

2010-09-01

Full Text Available This article reviewed T.L. Donaldson’s book, Jesus on the mountain: A study in Matthean theology, published in 1985 by JSOT Press, Sheffield, and focused on the mountain motif in the structure and plot of the Gospel of Matthew, in addition to the work of Donaldson on the mountain motif as a literary motif and as theological symbol. The mountain is a primary theological setting for Jesus’ ministry and thus is an important setting, serving as one of the literary devices by which Matthew structured and progressed his narrative. The Zion theological and eschatological significance and Second Temple Judaism serve as the historical and theological background for the mountain motif. The last mountain setting (Mt 28:16–20 is the culmination of the three theological themes in the plot of Matthew, namely Christology, ecclesiology and salvation history.

Spectrometric study of the folding process of i-motif-forming DNA sequences upstream of the c-kit transcription initiation site

International Nuclear Information System (INIS)

Bucek, Pavel; Gargallo, Raimundo; Kudrev, Andrei

2010-01-01

The c-kit oncogene shows a cytosine-rich DNA region upstream of the transcription initiation site which forms an i-motif structure at slightly acidic pH values (Bucek et al. ). In the present study, the pH-induced formation of i-motif - forming sequences 5'-CCC CTC CCT CGC GCC CGC CCG-3' (ckitC1, native), 5'-CCC TTC CCT TGT GCC CGC CCG-3' (ckitC2) and 5'-CCCTT CCC TTTTT CCC T CCC T-3' (ckitC3) was studied by spectroscopic techniques, such as UV molecular absorption and circular dichroism (CD), in tandem with two multivariate data analysis methods, the hard modelling-based matrix method and the soft modelling-based MCR-ALS approach. Use of the hard chemical modelling enabled us to propose the equilibrium model, which describes spectral changes as functions of solution acidity. Additionally, the intrinsic protonation constant, K in , and the cooperativity parameters, ω c , and ω a , were calculated from the fitting procedure of the coupled CD and molecular absorption spectra. In the case of ckitC2 and ckitC3, the hard model correctly reproduced the spectral variations observed experimentally. The results indicated that folding was accompanied by a cooperative process, i.e. the enhancement of protonated structure stability upon protonation. In contrast, unfolding was accompanied by an anticooperative process. Finally, folding of the native sequence, ckitC1, seemed to follow a more complex mechanism.

Disparate requirements for the Walker A and B ATPase motifs of human RAD51D in homologous recombination.

Science.gov (United States)

Wiese, Claudia; Hinz, John M; Tebbs, Robert S; Nham, Peter B; Urbin, Salustra S; Collins, David W; Thompson, Larry H; Schild, David

2006-01-01

In vertebrates, homologous recombinational repair (HRR) requires RAD51 and five RAD51 paralogs (XRCC2, XRCC3, RAD51B, RAD51C and RAD51D) that all contain conserved Walker A and B ATPase motifs. In human RAD51D we examined the requirement for these motifs in interactions with XRCC2 and RAD51C, and for survival of cells in response to DNA interstrand crosslinks (ICLs). Ectopic expression of wild-type human RAD51D or mutants having a non-functional A or B motif was used to test for complementation of a rad51d knockout hamster CHO cell line. Although A-motif mutants complement very efficiently, B-motif mutants do not. Consistent with these results, experiments using the yeast two- and three-hybrid systems show that the interactions between RAD51D and its XRCC2 and RAD51C partners also require a functional RAD51D B motif, but not motif A. Similarly, hamster Xrcc2 is unable to bind to the non-complementing human RAD51D B-motif mutants in co-immunoprecipitation assays. We conclude that a functional Walker B motif, but not A motif, is necessary for RAD51D's interactions with other paralogs and for efficient HRR. We present a model in which ATPase sites are formed in a bipartite manner between RAD51D and other RAD51 paralogs.

Domination versus disjunctive domination in graphs | Henning ...

African Journals Online (AJOL)

Domination versus disjunctive domination in graphs. Michael A Henning, Sinclair A Marcon. Abstract. A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, ...

Generating Realistic Labelled, Weighted Random Graphs

Directory of Open Access Journals (Sweden)

Michael Charles Davis

2015-12-01

Full Text Available Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs. Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.

Identification of putative regulatory motifs in the upstream regions of co-expressed functional groups of genes in Plasmodium falciparum

Directory of Open Access Journals (Sweden)

Joshi NV

2009-01-01

Full Text Available Abstract Background Regulation of gene expression in Plasmodium falciparum (Pf remains poorly understood. While over half the genes are estimated to be regulated at the transcriptional level, few regulatory motifs and transcription regulators have been found. Results The study seeks to identify putative regulatory motifs in the upstream regions of 13 functional groups of genes expressed in the intraerythrocytic developmental cycle of Pf. Three motif-discovery programs were used for the purpose, and motifs were searched for only on the gene coding strand. Four motifs – the 'G-rich', the 'C-rich', the 'TGTG' and the 'CACA' motifs – were identified, and zero to all four of these occur in the 13 sets of upstream regions. The 'CACA motif' was absent in functional groups expressed during the ring to early trophozoite transition. For functional groups expressed in each transition, the motifs tended to be similar. Upstream motifs in some functional groups showed 'positional conservation' by occurring at similar positions relative to the translational start site (TLS; this increases their significance as regulatory motifs. In the ribonucleotide synthesis, mitochondrial, proteasome and organellar translation machinery genes, G-rich, C-rich, CACA and TGTG motifs, respectively, occur with striking positional conservation. In the organellar translation machinery group, G-rich motifs occur close to the TLS. The same motifs were sometimes identified for multiple functional groups; differences in location and abundance of the motifs appear to ensure different modes of action. Conclusion The identification of positionally conserved over-represented upstream motifs throws light on putative regulatory elements for transcription in Pf.

Canonical Bcl-2 motifs of the Na+/K+ pump revealed by the BH3 mimetic chelerythrine: early signal transducers of apoptosis?

Science.gov (United States)

Lauf, Peter K; Heiny, Judith; Meller, Jarek; Lepera, Michael A; Koikov, Leonid; Alter, Gerald M; Brown, Thomas L; Adragna, Norma C

2013-01-01

Chelerythrine [CET], a protein kinase C [PKC] inhibitor, is a prop-apoptotic BH3-mimetic binding to BH1-like motifs of Bcl-2 proteins. CET action was examined on PKC phosphorylation-dependent membrane transporters (Na+/K+ pump/ATPase [NKP, NKA], Na+-K+-2Cl+ [NKCC] and K+-Cl- [KCC] cotransporters, and channel-supported K+ loss) in human lens epithelial cells [LECs]. K+ loss and K+ uptake, using Rb+ as congener, were measured by atomic absorption/emission spectrophotometry with NKP and NKCC inhibitors, and Cl- replacement by NO3ˉ to determine KCC. 3H-Ouabain binding was performed on a pig renal NKA in the presence and absence of CET. Bcl-2 protein and NKA sequences were aligned and motifs identified and mapped using PROSITE in conjunction with BLAST alignments and analysis of conservation and structural similarity based on prediction of secondary and crystal structures. CET inhibited NKP and NKCC by >90% (IC50 values ~35 and ~15 μM, respectively) without significant KCC activity change, and stimulated K+ loss by ~35% at 10-30 μM. Neither ATP levels nor phosphorylation of the NKA α1 subunit changed. 3H-ouabain was displaced from pig renal NKA only at 100 fold higher CET concentrations than the ligand. Sequence alignments of NKA with BH1- and BH3-like motifs containing pro-survival Bcl-2 and BclXl proteins showed more than one BH1-like motif within NKA for interaction with CET or with BH3 motifs. One NKA BH1-like motif (ARAAEILARDGPN) was also found in all P-type ATPases. Also, NKA possessed a second motif similar to that near the BH3 region of Bcl-2. Findings support the hypothesis that CET inhibits NKP by binding to BH1-like motifs and disrupting the α1 subunit catalytic activity through conformational changes. By interacting with Bcl-2 proteins through their complementary BH1- or BH3-like-motifs, NKP proteins may be sensors of normal and pathological cell functions, becoming important yet unrecognized signal transducers in the initial phases of apoptosis. CET

Coloring triangle-free graphs with fixed size

DEFF Research Database (Denmark)

Thomassen, Carsten; Gimbel, John

2000-01-01

Combining recent results on colorings and Ramsey theory, we show that if G is a triangle-free graph with e edges then the chromatic number of G is at most cel(1/3)(log e)(-2/3) for some constant c. In a previous paper, we found an upper bound on the chromatic number of a triangle-free graph of ge...

Encoding and analyzing aerial imagery using geospatial semantic graphs

Energy Technology Data Exchange (ETDEWEB)

Watson, Jean-Paul; Strip, David R.; McLendon, William Clarence,; Parekh, Ojas D.; Diegert, Carl F.; Martin, Shawn Bryan; Rintoul, Mark Daniel

2014-02-01

While collection capabilities have yielded an ever-increasing volume of aerial imagery, analytic techniques for identifying patterns in and extracting relevant information from this data have seriously lagged. The vast majority of imagery is never examined, due to a combination of the limited bandwidth of human analysts and limitations of existing analysis tools. In this report, we describe an alternative, novel approach to both encoding and analyzing aerial imagery, using the concept of a geospatial semantic graph. The advantages of our approach are twofold. First, intuitive templates can be easily specified in terms of the domain language in which an analyst converses. These templates can be used to automatically and efficiently search large graph databases, for specific patterns of interest. Second, unsupervised machine learning techniques can be applied to automatically identify patterns in the graph databases, exposing recurring motifs in imagery. We illustrate our approach using real-world data for Anne Arundel County, Maryland, and compare the performance of our approach to that of an expert human analyst.

Destroying longest cycles in graphs and digraphs

DEFF Research Database (Denmark)

Van Aardt, Susan A.; Burger, Alewyn P.; Dunbar, Jean E.

2015-01-01

In 1978, C. Thomassen proved that in any graph one can destroy all the longest cycles by deleting at most one third of the vertices. We show that for graphs with circumference k≤8 it suffices to remove at most 1/k of the vertices. The Petersen graph demonstrates that this result cannot be extended...... to include k=9 but we show that in every graph with circumference nine we can destroy all 9-cycles by removing 1/5 of the vertices. We consider the analogous problem for digraphs and show that for digraphs with circumference k=2,3, it suffices to remove 1/k of the vertices. However this does not hold for k≥4....

Joint Graph Layouts for Visualizing Collections of Segmented Meshes

KAUST Repository

Ren, Jing

2017-09-12

We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.

Joint Graph Layouts for Visualizing Collections of Segmented Meshes

KAUST Repository

Ren, Jing; Schneider, Jens; Ovsjanikov, Maks; Wonka, Peter

2017-01-01

We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.

Skeletal muscle cell contraction reduces a novel myokine, chemokine (C-X-C motif) ligand 10 (CXCL10): potential roles in exercise-regulated angiogenesis.

Science.gov (United States)

Ishiuchi, Yuri; Sato, Hitoshi; Tsujimura, Kazuki; Kawaguchi, Hideo; Matsuwaki, Takashi; Yamanouchi, Keitaro; Nishihara, Masugi; Nedachi, Taku

2018-01-01

Accumulating evidence indicates that skeletal muscle secrets proteins referred to as myokines and that exercise contributes to their regulation. In this study, we propose that chemokine (C-X-C motif) ligand 10 (CXCL10) functions as a novel myokine. Initially, we stimulated differentiated C2C12 myotubes with or without electrical pulse stimulation (EPS) to identify novel myokines. Cytokine array analysis revealed that CXCL10 secretion was significantly reduced by EPS, which was further confirmed by enzyme-linked immunosorbent assay and quantitative polymerase chain reaction analysis. Treadmill experiments in mice identified significant reduction of Cxcl10 gene expression in the soleus muscle. Additionally, contraction-dependent p38 MAPK activation appeared to be involved in this reduction. Furthermore, C2C12 conditioned medium obtained after applying EPS could induce survival of MSS31, a vascular endothelial cell model, which was partially attenuated by the addition of recombinant CXCL10. Overall, our findings suggest CXCL10 as a novel exercise-reducible myokine, to control endothelial cell viability.

The groupies of random multipartite graphs

OpenAIRE

Portmann, Marius; Wang, Hongyun

2012-01-01

If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.

Efficient dynamic graph construction for inductive semi-supervised learning.

Science.gov (United States)

Dornaika, F; Dahbi, R; Bosaghzadeh, A; Ruichek, Y

2017-10-01

Most of graph construction techniques assume a transductive setting in which the whole data collection is available at construction time. Addressing graph construction for inductive setting, in which data are coming sequentially, has received much less attention. For inductive settings, constructing the graph from scratch can be very time consuming. This paper introduces a generic framework that is able to make any graph construction method incremental. This framework yields an efficient and dynamic graph construction method that adds new samples (labeled or unlabeled) to a previously constructed graph. As a case study, we use the recently proposed Two Phase Weighted Regularized Least Square (TPWRLS) graph construction method. The paper has two main contributions. First, we use the TPWRLS coding scheme to represent new sample(s) with respect to an existing database. The representative coefficients are then used to update the graph affinity matrix. The proposed method not only appends the new samples to the graph but also updates the whole graph structure by discovering which nodes are affected by the introduction of new samples and by updating their edge weights. The second contribution of the article is the application of the proposed framework to the problem of graph-based label propagation using multiple observations for vision-based recognition tasks. Experiments on several image databases show that, without any significant loss in the accuracy of the final classification, the proposed dynamic graph construction is more efficient than the batch graph construction. Copyright © 2017 Elsevier Ltd. All rights reserved.

Linear motif atlas for phosphorylation-dependent signaling

DEFF Research Database (Denmark)

Miller, Martin Lee; Jensen, LJ; Diella, F

2008-01-01

bind to them remains a challenge. NetPhorest is an atlas of consensus sequence motifs that covers 179 kinases and 104 phosphorylation-dependent binding domains [Src homology 2 (SH2), phosphotyrosine binding (PTB), BRCA1 C-terminal (BRCT), WW, and 14-3-3]. The atlas reveals new aspects of signaling...

Bell inequalities for graph states

International Nuclear Information System (INIS)

Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

2005-01-01

Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

Local adjacency metric dimension of sun graph and stacked book graph

Science.gov (United States)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

Planar graphs theory and algorithms

CERN Document Server

Nishizeki, T

1988-01-01

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

Identification of high-efficiency 3′GG gRNA motifs in indexed FASTA files with ngg2

Directory of Open Access Journals (Sweden)

Elisha D. Roberson

2015-11-01

Full Text Available CRISPR/Cas9 is emerging as one of the most-used methods of genome modification in organisms ranging from bacteria to human cells. However, the efficiency of editing varies tremendously site-to-site. A recent report identified a novel motif, called the 3′GG motif, which substantially increases the efficiency of editing at all sites tested in C. elegans. Furthermore, they highlighted that previously published gRNAs with high editing efficiency also had this motif. I designed a Python command-line tool, ngg2, to identify 3′GG gRNA sites from indexed FASTA files. As a proof-of-concept, I screened for these motifs in six model genomes: Saccharomyces cerevisiae, Caenorhabditis elegans, Drosophila melanogaster, Danio rerio, Mus musculus, and Homo sapiens. I also scanned the genomes of pig (Sus scrofa and African elephant (Loxodonta africana to demonstrate the utility in non-model organisms. I identified more than 60 million single match 3′GG motifs in these genomes. Greater than 61% of all protein coding genes in the reference genomes had at least one unique 3′GG gRNA site overlapping an exon. In particular, more than 96% of mouse and 93% of human protein coding genes have at least one unique, overlapping 3′GG gRNA. These identified sites can be used as a starting point in gRNA selection, and the ngg2 tool provides an important ability to identify 3′GG editing sites in any species with an available genome sequence.

1-[3-(2-Benzyloxy-6-hydroxy-4-methylphenyl-5-[3,5-bis(trifluoromethylphenyl]-4,5-dihydro-1H-pyrazol-1-yl]propane-1-one

Directory of Open Access Journals (Sweden)

U. H. Patel

2013-06-01

Full Text Available In the title compound, C28H24F6N2O3, the mean plane of the central pyrazoline ring forms dihedral angles of 2.08 (9 and 69.02 (16° with the 2-benzyloxy-6-hydroxy-4-methylphenyl and 3,5-bis(trifluoromethylphenyl rings, respectively. The dihedral angle between the mean planes of the pyrazoline and 3,5-bis(trifluoromethylphenyl rings is 68.97 (9°. An intramolecular O—H...N hydrogen bond is observed, which forms an S(6 graph-set motif. In the crystal, pairs of weak C—H...F halogen interactions link the molecules into inversion dimers while molecular chains along [100] are formed by C—H...O contacts.

SNAP: A General Purpose Network Analysis and Graph Mining Library.

Science.gov (United States)

Leskovec, Jure; Sosič, Rok

2016-10-01

Large networks are becoming a widely used abstraction for studying complex systems in a broad set of disciplines, ranging from social network analysis to molecular biology and neuroscience. Despite an increasing need to analyze and manipulate large networks, only a limited number of tools are available for this task. Here, we describe Stanford Network Analysis Platform (SNAP), a general-purpose, high-performance system that provides easy to use, high-level operations for analysis and manipulation of large networks. We present SNAP functionality, describe its implementational details, and give performance benchmarks. SNAP has been developed for single big-memory machines and it balances the trade-off between maximum performance, compact in-memory graph representation, and the ability to handle dynamic graphs where nodes and edges are being added or removed over time. SNAP can process massive networks with hundreds of millions of nodes and billions of edges. SNAP offers over 140 different graph algorithms that can efficiently manipulate large graphs, calculate structural properties, generate regular and random graphs, and handle attributes and meta-data on nodes and edges. Besides being able to handle large graphs, an additional strength of SNAP is that networks and their attributes are fully dynamic, they can be modified during the computation at low cost. SNAP is provided as an open source library in C++ as well as a module in Python. We also describe the Stanford Large Network Dataset, a set of social and information real-world networks and datasets, which we make publicly available. The collection is a complementary resource to our SNAP software and is widely used for development and benchmarking of graph analytics algorithms.

MotifNet: a web-server for network motif analysis.

Science.gov (United States)

Smoly, Ilan Y; Lerman, Eugene; Ziv-Ukelson, Michal; Yeger-Lotem, Esti

2017-06-15

Network motifs are small topological patterns that recur in a network significantly more often than expected by chance. Their identification emerged as a powerful approach for uncovering the design principles underlying complex networks. However, available tools for network motif analysis typically require download and execution of computationally intensive software on a local computer. We present MotifNet, the first open-access web-server for network motif analysis. MotifNet allows researchers to analyze integrated networks, where nodes and edges may be labeled, and to search for motifs of up to eight nodes. The output motifs are presented graphically and the user can interactively filter them by their significance, number of instances, node and edge labels, and node identities, and view their instances. MotifNet also allows the user to distinguish between motifs that are centered on specific nodes and motifs that recur in distinct parts of the network. MotifNet is freely available at http://netbio.bgu.ac.il/motifnet . The website was implemented using ReactJs and supports all major browsers. The server interface was implemented in Python with data stored on a MySQL database. estiyl@bgu.ac.il or michaluz@cs.bgu.ac.il. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

meso-4,4′-Dimethoxy-2,2′-{[(3aR,7aS-2,3,3a,4,5,6,7,7a-octahydro-1H-benzimidazole-1,3-diyl]bis(methylene}diphenol

Directory of Open Access Journals (Sweden)

Augusto Rivera

2013-07-01

Full Text Available The title compound, C23H30N2O4, a di-Mannich base derived from 4-methoxyphenol and cis-1,2-diaminecyclohexane, has a perhydrobenzimidazolidine nucleus, in which the cyclohexane ring adopts a chair conformation and the heterocyclic ring has a half-chair conformation with a C—N—C—C torsion angles of −48.14 (15 and −14.57 (16°. The mean plane of the heterocycle makes dihedral angles of 86.29 (6 and 78.92 (6° with the pendant benzene rings. The molecular structure of the title compound shows the presence of two interactions between the N atoms of the imidazolidine ring and the hydroxyl groups through intramolecular O—H...N hydrogen bonds with graph-set motif S(6. The unobserved lone pairs of the N atoms are presumed to be disposed in a syn conformation, being only the second example of an exception to the typical `rabbit-ears' effect in 1,2-diamines.

Dicyclohexylammonium 3,5-dinitrobenzoate

Directory of Open Access Journals (Sweden)

Sohail Saeed

2012-07-01

Full Text Available The asymmetric unit of the title salt, C12H24N+·C7H3N2O6−, contains two cations and two anions. In the crystal, the cations and anions are connected by N—H...O hydrogen bonds, forming a 12-membered ring with an R44(12 graph-set motif. The center of this 12-membered ring coincides with an inversion centre. π–π stacking is observed between parallel benzene rings [centroid–centriod distance = 3.771 (2 Å].

Equitable Colorings Of Corona Multiproducts Of Graphs

Directory of Open Access Journals (Sweden)

Furmánczyk Hanna

2017-11-01

Full Text Available A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G. It is known that the problem of computation of =(G is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013 103–120].

Efficient sequential and parallel algorithms for finding edit distance based motifs.

Science.gov (United States)

Pal, Soumitra; Xiao, Peng; Rajasekaran, Sanguthevar

2016-08-18

Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several novel, exact, sequential and parallel algorithms for solving the (l,d) Edit-distance-based Motif Search (EMS) problem: given two integers l,d and n biological strings, find all strings of length l that appear in each input string with atmost d errors of types substitution, insertion and deletion. One popular technique to solve the problem is to explore for each input string the set of all possible l-mers that belong to the d-neighborhood of any substring of the input string and output those which are common for all input strings. We introduce a novel and provably efficient neighborhood exploration technique. We show that it is enough to consider the candidates in neighborhood which are at a distance exactly d. We compactly represent these candidate motifs using wildcard characters and efficiently explore them with very few repetitions. Our sequential algorithm uses a trie based data structure to efficiently store and sort the candidate motifs. Our parallel algorithm in a multi-core shared memory setting uses arrays for storing and a novel modification of radix-sort for sorting the candidate motifs. The algorithms for EMS are customarily evaluated on several challenging instances such as (8,1), (12,2), (16,3), (20,4), and so on. The best previously known algorithm, EMS1, is sequential and in estimated 3 days solves up to instance (16,3). Our sequential algorithms are more than 20 times faster on (16,3). On other hard instances such as (9,2), (11,3), (13,4), our algorithms are much faster. Our parallel algorithm has more than 600 % scaling performance while using 16 threads. Our algorithms have pushed up the state-of-the-art of EMS solvers and we believe that the techniques introduced in

DNA motif elucidation using belief propagation.

Science.gov (United States)

Wong, Ka-Chun; Chan, Tak-Ming; Peng, Chengbin; Li, Yue; Zhang, Zhaolei

2013-09-01

Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k=8∼10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors' websites: e.g. http://www.cs.toronto.edu/∼wkc/kmerHMM.

DNA motif elucidation using belief propagation

KAUST Repository

Wong, Ka-Chun; Chan, Tak-Ming; Peng, Chengbin; Li, Yue; Zhang, Zhaolei

2013-01-01

Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k = 8 ?10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors' websites: e.g. http://www.cs.toronto.edu/?wkc/kmerHMM. 2013 The Author(s).

DNA motif elucidation using belief propagation

KAUST Repository

Wong, Ka-Chun

2013-06-29

Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k = 8 ?10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors\\' websites: e.g. http://www.cs.toronto.edu/?wkc/kmerHMM. 2013 The Author(s).

$1$-string $B_2$-VPG representation of planar graphs

Directory of Open Access Journals (Sweden)

Therese Biedl

2016-09-01

Full Text Available In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices $u,v$ intersect precisely once whenever there is an edge between $u$ and $v$. We also show that only a subset of the possible curve shapes is necessary to represent $4$-connected planar graphs.

A note on arbitrarily vertex decomposable graphs

Directory of Open Access Journals (Sweden)

Antoni Marczyk

2006-01-01

Full Text Available A graph \\(G\\ of order \\(n\\ is said to be arbitrarily vertex decomposable if for each sequence \\((n_{1},\\ldots,n_k\\ of positive integers such that \\(n_{1}+\\ldots+n_{k}=n\\ there exists a partition \\((V_{1},\\ldots,V_{k}\\ of the vertex set of \\(G\\ such that for each \\(i \\in \\{1,\\ldots,k\\}\\, \\(V_{i}\\ induces a connected subgraph of \\(G\\ on \\(n_i\\ vertices. In this paper we show that if \\(G\\ is a two-connected graph on \\(n\\ vertices with the independence number at most \\(\\lceil n/2\\rceil\\ and such that the degree sum of any pair of non-adjacent vertices is at least \\(n-3\\, then \\(G\\ is arbitrarily vertex decomposable. We present another result for connected graphs satisfying a similar condition, where the bound \\(n-3\\ is replaced by \\(n-2\\.

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

P. Anusha Devi

2015-10-01

Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

Canonical Bcl-2 Motifs of the Na+/K+ Pump Revealed by the BH3 Mimetic Chelerythrine: Early Signal Transducers of Apoptosis?

Directory of Open Access Journals (Sweden)

Peter K. Lauf

2013-02-01

Full Text Available Background/Aims: Chelerythrine [CET], a protein kinase C [PKC] inhibitor, is a prop-apoptotic BH3-mimetic binding to BH1-like motifs of Bcl-2 proteins. CET action was examined on PKC phosphorylation-dependent membrane transporters (Na+/K+ pump/ATPase [NKP, NKA], Na+-K+-2Cl+ [NKCC] and K+-Cl- [KCC] cotransporters, and channel-supported K+ loss in human lens epithelial cells [LECs]. Methods: K+ loss and K+ uptake, using Rb+ as congener, were measured by atomic absorption/emission spectrophotometry with NKP and NKCC inhibitors, and Cl- replacement by NO3ˉ to determine KCC. 3H-Ouabain binding was performed on a pig renal NKA in the presence and absence of CET. Bcl-2 protein and NKA sequences were aligned and motifs identified and mapped using PROSITE in conjunction with BLAST alignments and analysis of conservation and structural similarity based on prediction of secondary and crystal structures. Results: CET inhibited NKP and NKCC by >90% (IC50 values ∼35 and ∼15 µM, respectively without significant KCC activity change, and stimulated K+ loss by ∼35% at 10-30 µM. Neither ATP levels nor phosphorylation of the NKA α1 subunit changed. 3H-ouabain was displaced from pig renal NKA only at 100 fold higher CET concentrations than the ligand. Sequence alignments of NKA with BH1- and BH3-like motifs containing pro-survival Bcl-2 and BclXl proteins showed more than one BH1-like motif within NKA for interaction with CET or with BH3 motifs. One NKA BH1-like motif (ARAAEILARDGPN was also found in all P-type ATPases. Also, NKA possessed a second motif similar to that near the BH3 region of Bcl-2. Conclusion: Findings support the hypothesis that CET inhibits NKP by binding to BH1-like motifs and disrupting the α1 subunit catalytic activity through conformational changes. By interacting with Bcl-2 proteins through their complementary BH1- or BH3-like-motifs, NKP proteins may be sensors of normal and pathological cell functions, becoming important yet

Alliances and Bisection Width for Planar Graphs

DEFF Research Database (Denmark)

Olsen, Martin; Revsbæk, Morten

2013-01-01

An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...

A new characterization of trivially perfect graphs

Directory of Open Access Journals (Sweden)

Christian Rubio Montiel

2015-03-01

Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

Simplifying Scalable Graph Processing with a Domain-Specific Language

KAUST Repository

Hong, Sungpack; Salihoglu, Semih; Widom, Jennifer; Olukotun, Kunle

2014-01-01

Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel's programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.

Simplifying Scalable Graph Processing with a Domain-Specific Language

KAUST Repository

Hong, Sungpack

2014-01-01

Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel\\'s programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.

Identification of sequence motifs significantly associated with antisense activity

Directory of Open Access Journals (Sweden)

Peek Andrew S

2007-06-01

Full Text Available Abstract Background Predicting the suppression activity of antisense oligonucleotide sequences is the main goal of the rational design of nucleic acids. To create an effective predictive model, it is important to know what properties of an oligonucleotide sequence associate significantly with antisense activity. Also, for the model to be efficient we must know what properties do not associate significantly and can be omitted from the model. This paper will discuss the results of a randomization procedure to find motifs that associate significantly with either high or low antisense suppression activity, analysis of their properties, as well as the results of support vector machine modelling using these significant motifs as features. Results We discovered 155 motifs that associate significantly with high antisense suppression activity and 202 motifs that associate significantly with low suppression activity. The motifs range in length from 2 to 5 bases, contain several motifs that have been previously discovered as associating highly with antisense activity, and have thermodynamic properties consistent with previous work associating thermodynamic properties of sequences with their antisense activity. Statistical analysis revealed no correlation between a motif's position within an antisense sequence and that sequences antisense activity. Also, many significant motifs existed as subwords of other significant motifs. Support vector regression experiments indicated that the feature set of significant motifs increased correlation compared to all possible motifs as well as several subsets of the significant motifs. Conclusion The thermodynamic properties of the significantly associated motifs support existing data correlating the thermodynamic properties of the antisense oligonucleotide with antisense efficiency, reinforcing our hypothesis that antisense suppression is strongly associated with probe/target thermodynamics, as there are no enzymatic

Quasirecognition by prime graph of finite simple groups ${}^2D_n(3$

Directory of Open Access Journals (Sweden)

Behrooz Khosravi

2014-12-01

Full Text Available Let $G$ be a finite group. In [Ghasemabadi et al., characterizations of the simple group ${}^2D_n(3$ by prime graph and spectrum, Monatsh Math., 2011] it is proved that if $n$ is odd, then ${}^2D _n(3$ is recognizable by prime graph and also by element orders. In this paper we prove that if $n$ is even, then $D={}^2D_{n}(3$ is quasirecognizable by prime graph, i.e. every finite group $G$ with $Gamma(G=Gamma(D$ has a unique nonabelian composition factor and this factor is isomorphic to $D$.

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Directory of Open Access Journals (Sweden)

Katona Gyula Y.

2014-11-01

Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

Parallel Algorithms for Graph Optimization using Tree Decompositions

Energy Technology Data Exchange (ETDEWEB)

Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL; Groer, Christopher S [ORNL

2012-06-01

Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

GraphCrunch 2: Software tool for network modeling, alignment and clustering.

Science.gov (United States)

Kuchaiev, Oleksii; Stevanović, Aleksandar; Hayes, Wayne; Pržulj, Nataša

2011-01-19

Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an

GraphCrunch 2: Software tool for network modeling, alignment and clustering

Directory of Open Access Journals (Sweden)

Hayes Wayne

2011-01-01

Full Text Available Abstract Background Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. Results We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL" for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other

A generalization of zero divisor graphs associated to commutative ...

Indian Academy of Sciences (India)

M. Afkhami

2018-03-19

Mar 19, 2018 ... R . We also determine all isomorphic classes of finite commutative rings whose generalized zero divisor graphs have genus at most three. Keywords. Zero divisor graph; lower triangular matrix; genus; complete graph. 2010 Mathematics Subject Classification. 15B33, 05C10, 05C25, 05C45. 1. Introduction.

XML Graphs in Program Analysis

DEFF Research Database (Denmark)

Møller, Anders; Schwartzbach, Michael I.

2011-01-01

of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...

Material control study: a directed graph and fault tree procedure for adversary event set generation

International Nuclear Information System (INIS)

Lambert, H.E.; Lim, J.J.; Gilman, F.M.

1978-01-01

In work for the United States Nuclear Regulatory Commission, Lawrence Livermore Laboratory is developing an assessment procedure to evaluate the effectiveness of a potential nuclear facility licensee's material control (MC) system. The purpose of an MC system is to prevent the theft of special nuclear material such as plutonium and highly enriched uranium. The key in the assessment procedure is the generation and analysis of the adversary event sets by a directed graph and fault-tree methodology

Optimizing graph algorithms on pregel-like systems

KAUST Repository

Salihoglu, Semih; Widom, Jennifer

2014-01-01

We study the problem of implementing graph algorithms efficiently on Pregel-like systems, which can be surprisingly challenging. Standard graph algorithms in this setting can incur unnecessary inefficiencies such as slow convergence or high

A CRE/AP-1-like motif is essential for induced syncytin-2 expression and fusion in human trophoblast-like model.

Directory of Open Access Journals (Sweden)

Chirine Toufaily

Full Text Available Syncytin-2 is encoded by the envelope gene of Endogenous Retrovirus-FRD (ERVFRD-1 and plays a critical role in fusion of placental trophoblasts leading to the formation of the multinucleated syncytiotrophoblast. Its expression is consequently regulated in a strict manner. In the present study, we have identified a forskolin-responsive region located between positions -300 to -150 in the Syncytin-2 promoter region. This 150 bp region in the context of a minimal promoter mediated an 80-fold induction of promoter activity following forskolin stimulation. EMSA analyses with competition experiments with nuclear extracts from forskolin-stimulated BeWo cells demonstrated that the -211 to -177 region specifically bound two forskolin-induced complexes, one of them containing a CRE/AP-1-like motif. Site-directed mutagenesis of the CRE/AP-1 binding site in the context of the Syncytin-2 promoter or a heterologous promoter showed that this motif was mostly essential for forskolin-induced promoter activity. Transfection experiments with dominant negative mutants and constitutively activated CREB expression vectors in addition to Chromatin Immunoprecipitation suggested that a CREB family member, CREB2 was binding and acting through the CRE/AP-1 motif. We further demonstrated the binding of JunD to this same motif. Similar to forskolin and soluble cAMP, CREB2 and JunD overexpression induced Syncytin-2 promoter activity in a CRE/AP-1-dependent manner and Syncytin-2 expression. In addition, BeWo cell fusion was induced by both CREB2 and JunD overexpression, while being repressed following silencing of either gene. These results thereby demonstrate that induced expression of Syncytin-2 is highly dependent on the interaction of bZIP-containing transcription factors to a CRE/AP-1 motif and that this element is important for the regulation of Syncytin-2 expression, which results in the formation of the peripheral syncytiotrophoblast layer.

Percolator: Scalable Pattern Discovery in Dynamic Graphs

Energy Technology Data Exchange (ETDEWEB)

Choudhury, Sutanay; Purohit, Sumit; Lin, Peng; Wu, Yinghui; Holder, Lawrence B.; Agarwal, Khushbu

2018-02-06

We demonstrate Percolator, a distributed system for graph pattern discovery in dynamic graphs. In contrast to conventional mining systems, Percolator advocates efficient pattern mining schemes that (1) support pattern detection with keywords; (2) integrate incremental and parallel pattern mining; and (3) support analytical queries such as trend analysis. The core idea of Percolator is to dynamically decide and verify a small fraction of patterns and their in- stances that must be inspected in response to buffered updates in dynamic graphs, with a total mining cost independent of graph size. We demonstrate a) the feasibility of incremental pattern mining by walking through each component of Percolator, b) the efficiency and scalability of Percolator over the sheer size of real-world dynamic graphs, and c) how the user-friendly GUI of Percolator inter- acts with users to support keyword-based queries that detect, browse and inspect trending patterns. We also demonstrate two user cases of Percolator, in social media trend analysis and academic collaboration analysis, respectively.

Seed storage protein gene promoters contain conserved DNA motifs in Brassicaceae, Fabaceae and Poaceae

Science.gov (United States)

Fauteux, François; Strömvik, Martina V

2009-01-01

Background Accurate computational identification of cis-regulatory motifs is difficult, particularly in eukaryotic promoters, which typically contain multiple short and degenerate DNA sequences bound by several interacting factors. Enrichment in combinations of rare motifs in the promoter sequence of functionally or evolutionarily related genes among several species is an indicator of conserved transcriptional regulatory mechanisms. This provides a basis for the computational identification of cis-regulatory motifs. Results We have used a discriminative seeding DNA motif discovery algorithm for an in-depth analysis of 54 seed storage protein (SSP) gene promoters from three plant families, namely Brassicaceae (mustards), Fabaceae (legumes) and Poaceae (grasses) using backgrounds based on complete sets of promoters from a representative species in each family, namely Arabidopsis (Arabidopsis thaliana (L.) Heynh.), soybean (Glycine max (L.) Merr.) and rice (Oryza sativa L.) respectively. We have identified three conserved motifs (two RY-like and one ACGT-like) in Brassicaceae and Fabaceae SSP gene promoters that are similar to experimentally characterized seed-specific cis-regulatory elements. Fabaceae SSP gene promoter sequences are also enriched in a novel, seed-specific E2Fb-like motif. Conserved motifs identified in Poaceae SSP gene promoters include a GCN4-like motif, two prolamin-box-like motifs and an Skn-1-like motif. Evidence of the presence of a variant of the TATA-box is found in the SSP gene promoters from the three plant families. Motifs discovered in SSP gene promoters were used to score whole-genome sets of promoters from Arabidopsis, soybean and rice. The highest-scoring promoters are associated with genes coding for different subunits or precursors of seed storage proteins. Conclusion Seed storage protein gene promoter motifs are conserved in diverse species, and different plant families are characterized by a distinct combination of conserved motifs

Seed storage protein gene promoters contain conserved DNA motifs in Brassicaceae, Fabaceae and Poaceae

Directory of Open Access Journals (Sweden)

Fauteux François

2009-10-01

Full Text Available Abstract Background Accurate computational identification of cis-regulatory motifs is difficult, particularly in eukaryotic promoters, which typically contain multiple short and degenerate DNA sequences bound by several interacting factors. Enrichment in combinations of rare motifs in the promoter sequence of functionally or evolutionarily related genes among several species is an indicator of conserved transcriptional regulatory mechanisms. This provides a basis for the computational identification of cis-regulatory motifs. Results We have used a discriminative seeding DNA motif discovery algorithm for an in-depth analysis of 54 seed storage protein (SSP gene promoters from three plant families, namely Brassicaceae (mustards, Fabaceae (legumes and Poaceae (grasses using backgrounds based on complete sets of promoters from a representative species in each family, namely Arabidopsis (Arabidopsis thaliana (L. Heynh., soybean (Glycine max (L. Merr. and rice (Oryza sativa L. respectively. We have identified three conserved motifs (two RY-like and one ACGT-like in Brassicaceae and Fabaceae SSP gene promoters that are similar to experimentally characterized seed-specific cis-regulatory elements. Fabaceae SSP gene promoter sequences are also enriched in a novel, seed-specific E2Fb-like motif. Conserved motifs identified in Poaceae SSP gene promoters include a GCN4-like motif, two prolamin-box-like motifs and an Skn-1-like motif. Evidence of the presence of a variant of the TATA-box is found in the SSP gene promoters from the three plant families. Motifs discovered in SSP gene promoters were used to score whole-genome sets of promoters from Arabidopsis, soybean and rice. The highest-scoring promoters are associated with genes coding for different subunits or precursors of seed storage proteins. Conclusion Seed storage protein gene promoter motifs are conserved in diverse species, and different plant families are characterized by a distinct combination

Survey of Approaches to Generate Realistic Synthetic Graphs

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2016-10-01

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.

Peptide-binding motifs of two common equine class I MHC molecules in Thoroughbred horses.

Science.gov (United States)

Bergmann, Tobias; Lindvall, Mikaela; Moore, Erin; Moore, Eugene; Sidney, John; Miller, Donald; Tallmadge, Rebecca L; Myers, Paisley T; Malaker, Stacy A; Shabanowitz, Jeffrey; Osterrieder, Nikolaus; Peters, Bjoern; Hunt, Donald F; Antczak, Douglas F; Sette, Alessandro

2017-05-01

Quantitative peptide-binding motifs of MHC class I alleles provide a valuable tool to efficiently identify putative T cell epitopes. Detailed information on equine MHC class I alleles is still very limited, and to date, only a single equine MHC class I allele, Eqca-1*00101 (ELA-A3 haplotype), has been characterized. The present study extends the number of characterized ELA class I specificities in two additional haplotypes found commonly in the Thoroughbred breed. Accordingly, we here report quantitative binding motifs for the ELA-A2 allele Eqca-16*00101 and the ELA-A9 allele Eqca-1*00201. Utilizing analyses of endogenously bound and eluted ligands and the screening of positional scanning combinatorial libraries, detailed and quantitative peptide-binding motifs were derived for both alleles. Eqca-16*00101 preferentially binds peptides with aliphatic/hydrophobic residues in position 2 and at the C-terminus, and Eqca-1*00201 has a preference for peptides with arginine in position 2 and hydrophobic/aliphatic residues at the C-terminus. Interestingly, the Eqca-16*00101 motif resembles that of the human HLA A02-supertype, while the Eqca-1*00201 motif resembles that of the HLA B27-supertype and two macaque class I alleles. It is expected that the identified motifs will facilitate the selection of candidate epitopes for the study of immune responses in horses.

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

Science.gov (United States)

2017-09-01

are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

Graph-based clustering and data visualization algorithms

CERN Document Server

Vathy-Fogarassy, Ágnes

2013-01-01

This work presents a data visualization technique that combines graph-based topology representation and dimensionality reduction methods to visualize the intrinsic data structure in a low-dimensional vector space. The application of graphs in clustering and visualization has several advantages. A graph of important edges (where edges characterize relations and weights represent similarities or distances) provides a compact representation of the entire complex data set. This text describes clustering and visualization methods that are able to utilize information hidden in these graphs, based on

Applied and computational harmonic analysis on graphs and networks

Science.gov (United States)

Irion, Jeff; Saito, Naoki

2015-09-01

In recent years, the advent of new sensor technologies and social network infrastructure has provided huge opportunities and challenges for analyzing data recorded on such networks. In the case of data on regular lattices, computational harmonic analysis tools such as the Fourier and wavelet transforms have well-developed theories and proven track records of success. It is therefore quite important to extend such tools from the classical setting of regular lattices to the more general setting of graphs and networks. In this article, we first review basics of graph Laplacian matrices, whose eigenpairs are often interpreted as the frequencies and the Fourier basis vectors on a given graph. We point out, however, that such an interpretation is misleading unless the underlying graph is either an unweighted path or cycle. We then discuss our recent effort of constructing multiscale basis dictionaries on a graph, including the Hierarchical Graph Laplacian Eigenbasis Dictionary and the Generalized Haar-Walsh Wavelet Packet Dictionary, which are viewed as generalizations of the classical hierarchical block DCTs and the Haar-Walsh wavelet packets, respectively, to the graph setting. Finally, we demonstrate the usefulness of our dictionaries by using them to simultaneously segment and denoise 1-D noisy signals sampled on regular lattices, a problem where classical tools have difficulty.

On path hypercompositions in graphs and automata

Directory of Open Access Journals (Sweden)

Massouros Christos G.

2016-01-01

Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

On two energy-like invariants of line graphs and related graph operations

Directory of Open Access Journals (Sweden)

Xiaodan Chen

2016-02-01

Full Text Available Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\\mu_{1}\\geq\\mu_{2}\\geq\\cdots\\geq\\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\\geq q_{2}\\geq\\cdots\\geq q_{n}\\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and incidence energy of G are defined as, respectively, LEL ( G = ∑ i = 1 n − 1 μ i and IE ( G = ∑ i = 1 n q i . $$\\mathit{LEL}(G=\\sum_{i=1}^{n-1}\\sqrt{ \\mu_{i}} \\quad\\mbox{and}\\quad \\mathit {IE}(G=\\sum_{i=1}^{n} \\sqrt{q_{i}}. $$ In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results. The main tools we use here are the Cauchy-Schwarz inequality and the Ozeki inequality.

The conserved basic residues and the charged amino acid residues at the α-helix of the zinc finger motif regulate the nuclear transport activity of triple C2H2 zinc finger proteins

Science.gov (United States)

Lin, Chih-Ying

2018-01-01

Zinc finger (ZF) motifs on proteins are frequently recognized as a structure for DNA binding. Accumulated reports indicate that ZF motifs contain nuclear localization signal (NLS) to facilitate the transport of ZF proteins into nucleus. We investigated the critical factors that facilitate the nuclear transport of triple C2H2 ZF proteins. Three conserved basic residues (hot spots) were identified among the ZF sequences of triple C2H2 ZF proteins that reportedly have NLS function. Additional basic residues can be found on the α-helix of the ZFs. Using the ZF domain (ZFD) of Egr-1 as a template, various mutants were constructed and expressed in cells. The nuclear transport activity of various mutants was estimated by analyzing the proportion of protein localized in the nucleus. Mutation at any hot spot of the Egr-1 ZFs reduced the nuclear transport activity. Changes of the basic residues at the α-helical region of the second ZF (ZF2) of the Egr-1 ZFD abolished the NLS activity. However, this activity can be restored by substituting the acidic residues at the homologous positions of ZF1 or ZF3 with basic residues. The restored activity dropped again when the hot spots at ZF1 or the basic residues in the α-helix of ZF3 were mutated. The variations in nuclear transport activity are linked directly to the binding activity of the ZF proteins with importins. This study was extended to other triple C2H2 ZF proteins. SP1 and KLF families, similar to Egr-1, have charged amino acid residues at the second (α2) and the third (α3) positions of the α-helix. Replacing the amino acids at α2 and α3 with acidic residues reduced the NLS activity of the SP1 and KLF6 ZFD. The reduced activity can be restored by substituting the α3 with histidine at any SP1 and KLF6 ZFD. The results show again the interchangeable role of ZFs and charge residues in the α-helix in regulating the NLS activity of triple C2H2 ZF proteins. PMID:29381770

An integrative and applicable phylogenetic footprinting framework for cis-regulatory motifs identification in prokaryotic genomes.

Science.gov (United States)

Liu, Bingqiang; Zhang, Hanyuan; Zhou, Chuan; Li, Guojun; Fennell, Anne; Wang, Guanghui; Kang, Yu; Liu, Qi; Ma, Qin

2016-08-09

Phylogenetic footprinting is an important computational technique for identifying cis-regulatory motifs in orthologous regulatory regions from multiple genomes, as motifs tend to evolve slower than their surrounding non-functional sequences. Its application, however, has several difficulties for optimizing the selection of orthologous data and reducing the false positives in motif prediction. Here we present an integrative phylogenetic footprinting framework for accurate motif predictions in prokaryotic genomes (MP(3)). The framework includes a new orthologous data preparation procedure, an additional promoter scoring and pruning method and an integration of six existing motif finding algorithms as basic motif search engines. Specifically, we collected orthologous genes from available prokaryotic genomes and built the orthologous regulatory regions based on sequence similarity of promoter regions. This procedure made full use of the large-scale genomic data and taxonomy information and filtered out the promoters with limited contribution to produce a high quality orthologous promoter set. The promoter scoring and pruning is implemented through motif voting by a set of complementary predicting tools that mine as many motif candidates as possible and simultaneously eliminate the effect of random noise. We have applied the framework to Escherichia coli k12 genome and evaluated the prediction performance through comparison with seven existing programs. This evaluation was systematically carried out at the nucleotide and binding site level, and the results showed that MP(3) consistently outperformed other popular motif finding tools. We have integrated MP(3) into our motif identification and analysis server DMINDA, allowing users to efficiently identify and analyze motifs in 2,072 completely sequenced prokaryotic genomes. The performance evaluation indicated that MP(3) is effective for predicting regulatory motifs in prokaryotic genomes. Its application may enhance

Perfect 2-colorings of the generalized Petersen graph

Indian Academy of Sciences (India)

It is obvious that GP(n, k) is a 3-regular connected graph. DEFINITION 2.2 ... vertex of color i, the number of its neighbors of color j is equal to aij . ... By the given conditions, we can see that a parameter matrix of a perfect 2-coloring of. GP(n, k) ...

Genus of total graphs from rings: A survey

Directory of Open Access Journals (Sweden)

T. Tamizh Chelvam

2018-04-01

Full Text Available Let R be a commutative ring. The total graph T Γ ( R of R is the undirected graph with vertex set R and two distinct vertices x and y are adjacent if x + y is a zero divisor in R . In this paper, we present a survey of results on the genus of T Γ ( R and three of its generalizations. Keywords: Commutative ring, Total graph, Cayley graph, Genus, Planar

Twin edge colorings of certain square graphs and product graphs

Directory of Open Access Journals (Sweden)

R Rajarajachozhan

2016-04-01

Full Text Available A twin edge $k\\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\\mathbb{Z}_k$ of the colors of the edges incident with $v,$ is a proper vertex $k\\!$-coloring. The minimum $k$ for which $G$ has a twin edge $k\\!$-coloring is called the twin chromatic index of $G.$ Twin chromatic index of the square $P_n^2,$ $n\\ge 4,$ and the square $C_n^2,$ $n\\ge 6,$ are determined. In fact, the twin chromatic index of the square $C_7^2$ is $\\Delta+2,$ where $\\Delta$ is the maximum degree. Twin chromatic index of $C_m\\,\\Box\\,P_n$ is determined, where $\\Box$ denotes the Cartesian product. $C_r$ and $P_r$ are, respectively, the cycle, and the path on $r$ vertices each.

Comparing brain networks of different size and connectivity density using graph theory.

Directory of Open Access Journals (Sweden)

Bernadette C M van Wijk

Full Text Available Graph theory is a valuable framework to study the organization of functional and anatomical connections in the brain. Its use for comparing network topologies, however, is not without difficulties. Graph measures may be influenced by the number of nodes (N and the average degree (k of the network. The explicit form of that influence depends on the type of network topology, which is usually unknown for experimental data. Direct comparisons of graph measures between empirical networks with different N and/or k can therefore yield spurious results. We list benefits and pitfalls of various approaches that intend to overcome these difficulties. We discuss the initial graph definition of unweighted graphs via fixed thresholds, average degrees or edge densities, and the use of weighted graphs. For instance, choosing a threshold to fix N and k does eliminate size and density effects but may lead to modifications of the network by enforcing (ignoring non-significant (significant connections. Opposed to fixing N and k, graph measures are often normalized via random surrogates but, in fact, this may even increase the sensitivity to differences in N and k for the commonly used clustering coefficient and small-world index. To avoid such a bias we tried to estimate the N,k-dependence for empirical networks, which can serve to correct for size effects, if successful. We also add a number of methods used in social sciences that build on statistics of local network structures including exponential random graph models and motif counting. We show that none of the here-investigated methods allows for a reliable and fully unbiased comparison, but some perform better than others.

Improvement of the Immunogenicity of Porcine Circovirus Type 2 DNA Vaccine by Recombinant ORF2 Gene and CpG Motifs.

Science.gov (United States)

Li, Jun; Shi, Jian-Li; Wu, Xiao-Yan; Fu, Fang; Yu, Jiang; Yuan, Xiao-Yuan; Peng, Zhe; Cong, Xiao-Yan; Xu, Shao-Jian; Sun, Wen-Bo; Cheng, Kai-Hui; Du, Yi-Jun; Wu, Jia-Qiang; Wang, Jin-Bao; Huang, Bao-Hua

2015-06-01

Nowadays, adjuvant is still important for boosting immunity and improving resistance in animals. In order to boost the immunity of porcine circovirus type 2 (PCV2) DNA vaccine, CpG motifs were inserted. In this study, the dose-effect was studied, and the immunity of PCV2 DNA vaccines by recombinant open reading frame 2 (ORF2) gene and CpG motifs was evaluated. Three-week-old Changbai piglets were inoculated intramuscularly with 200 μg, 400 μg, and 800 μg DNA vaccines containing 14 and 18 CpG motifs, respectively. Average gain and rectum temperature were recorded everyday during the experiments. Blood was collected from the piglets after vaccination to detect the changes of specific antibodies, interleukin-2, and immune cells every week. Tissues were collected for histopathology and polymerase chain reaction. The results indicated that compared to those of the control piglets, all concentrations of two DNA vaccines could induce PCV2-specific antibodies. A cellular immunity test showed that PCV2-specific lymphocytes proliferated the number of TH, TC, and CD3+ positive T-cells raised in the blood of DNA vaccine immune groups. There was no distinct pathological damage and viremia occurring in pigs that were inoculated with DNA vaccines, but there was some minor pathological damage in the control group. The results demonstrated that CpG motifs as an adjuvant could boost the humoral and cellular immunity of pigs to PCV2, especially in terms of cellular immunity. Comparing two DNA vaccines that were constructed, the one containing 18 CpG motifs was more effective. This is the first report that CpG motifs as an adjuvant insert to the PCV2 DNA vaccine could boost immunity.

PDB2Graph: A toolbox for identifying critical amino acids map in proteins based on graph theory.

Science.gov (United States)

Niknam, Niloofar; Khakzad, Hamed; Arab, Seyed Shahriar; Naderi-Manesh, Hossein

2016-05-01

The integrative and cooperative nature of protein structure involves the assessment of topological and global features of constituent parts. Network concept takes complete advantage of both of these properties in the analysis concomitantly. High compatibility to structural concepts or physicochemical properties in addition to exploiting a remarkable simplification in the system has made network an ideal tool to explore biological systems. There are numerous examples in which different protein structural and functional characteristics have been clarified by the network approach. Here, we present an interactive and user-friendly Matlab-based toolbox, PDB2Graph, devoted to protein structure network construction, visualization, and analysis. Moreover, PDB2Graph is an appropriate tool for identifying critical nodes involved in protein structural robustness and function based on centrality indices. It maps critical amino acids in protein networks and can greatly aid structural biologists in selecting proper amino acid candidates for manipulating protein structures in a more reasonable and rational manner. To introduce the capability and efficiency of PDB2Graph in detail, the structural modification of Calmodulin through allosteric binding of Ca(2+) is considered. In addition, a mutational analysis for three well-identified model proteins including Phage T4 lysozyme, Barnase and Ribonuclease HI, was performed to inspect the influence of mutating important central residues on protein activity. Copyright © 2016 Elsevier Ltd. All rights reserved.

Bi-induced sub graphs and stability number

Directory of Open Access Journals (Sweden)

Zverovich I.E.

2004-01-01

Full Text Available We define a 2-parametric hierarchy CLAP (m, n of bi-hereditary classes of graphs, and show that a maximum stable set can be found in polynomial time within each class CLAP (m, n. The classes can be recognized in polynomial time.

Some Results on the Independence Polynomial of Unicyclic Graphs

Directory of Open Access Journals (Sweden)

Oboudi Mohammad Reza

2018-05-01

Full Text Available Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x=∑k=0ns(G,kxk$I(G,x = \\sum\

The number of k-colorings of a graph on a fixed surface

DEFF Research Database (Denmark)

Thomassen, Carsten

2006-01-01

We prove that, for every fixed surface S, there exists a largest positive constant c such that every 5-colorable graph with n vertices on S has at least c center dot 2(n) distinct 5-colorings. This is best possible in the sense that, for each sufficiently large natural number n, there is a graph ...

Laplacian eigenvectors of graphs Perron-Frobenius and Faber-Krahn type theorems

CERN Document Server

Biyikoğu, Türker; Stadler, Peter F

2007-01-01

Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors. The volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology.

Acyclicity in edge-colored graphs

DEFF Research Database (Denmark)

Gutin, Gregory; Jones, Mark; Sheng, Bin

2017-01-01

A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i......+1, i=1,2,3,4. The first three types are equivalent to the absence of PC cycles, PC closed trails, and PC closed walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored...... graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex...

Anion induced conformational preference of Cα NN motif residues in functional proteins.

Science.gov (United States)

Patra, Piya; Ghosh, Mahua; Banerjee, Raja; Chakrabarti, Jaydeb

2017-12-01

Among different ligand binding motifs, anion binding C α NN motif consisting of peptide backbone atoms of three consecutive residues are observed to be important for recognition of free anions, like sulphate or biphosphate and participate in different key functions. Here we study the interaction of sulphate and biphosphate with C α NN motif present in different proteins. Instead of total protein, a peptide fragment has been studied keeping C α NN motif flanked in between other residues. We use classical force field based molecular dynamics simulations to understand the stability of this motif. Our data indicate fluctuations in conformational preferences of the motif residues in absence of the anion. The anion gives stability to one of these conformations. However, the anion induced conformational preferences are highly sequence dependent and specific to the type of anion. In particular, the polar residues are more favourable compared to the other residues for recognising the anion. © 2017 Wiley Periodicals, Inc.

Degree-based graph construction

International Nuclear Information System (INIS)

Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A

2009-01-01

Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)

A conserved WW domain-like motif regulates invariant chain-dependent cell-surface transport of the NKG2D ligand ULBP2.

Science.gov (United States)

Uhlenbrock, Franziska; van Andel, Esther; Andresen, Lars; Skov, Søren

2015-08-01

Malignant cells expressing NKG2D ligands on their cell surface can be directly sensed and killed by NKG2D-bearing lymphocytes. To ensure this immune recognition, accumulating evidence suggests that NKG2D ligands are trafficed via alternative pathways to the cell surface. We have previously shown that the NKG2D ligand ULBP2 traffics over an invariant chain (Ii)-dependent pathway to the cell surface. This study set out to elucidate how Ii regulates ULBP2 cell-surface transport: We discovered conserved tryptophan (Trp) residues in the primary protein sequence of ULBP1-6 but not in the related MICA/B. Substitution of Trp to alanine resulted in cell-surface inhibition of ULBP2 in different cancer cell lines. Moreover, the mutated ULBP2 constructs were retained and not degraded inside the cell, indicating a crucial role of this conserved Trp-motif in trafficking. Finally, overexpression of Ii increased surface expression of wt ULBP2 while Trp-mutants could not be expressed, proposing that this Trp-motif is required for an Ii-dependent cell-surface transport of ULBP2. Aberrant soluble ULBP2 is immunosuppressive. Thus, targeting a distinct protein module on the ULBP2 sequence could counteract this abnormal expression of ULBP2. Copyright © 2015 Elsevier Ltd. All rights reserved.

On cyclic orthogonal double covers of circulant graphs by special infinite graphs

Directory of Open Access Journals (Sweden)

R. El-Shanawany

2017-12-01

Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

Quantum complexity of graph and algebraic problems

International Nuclear Information System (INIS)

Doern, Sebastian

2008-01-01

This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

Quantum complexity of graph and algebraic problems

Energy Technology Data Exchange (ETDEWEB)

Doern, Sebastian

2008-02-04

This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

The color space of a graph

DEFF Research Database (Denmark)

Jensen, T.R.; Thomassen, Carsten

2000-01-01

If k is a prime power, and G is a graph with n vertices, then a k-coloring of G may be considered as a vector in GF(k)(n). We prove that the subspace of GF(3)(n) spanned by all 3-colorings of a planar triangle-free graph with n vertices has dimension n. In particular, any such graph has at least n...... - 1 nonequivalent 3-colorings, and the addition of any edge or any vertex of degree 3 results in a 3-colorable graph. (C) 2000 John Wiley & Sons, Inc....

A model of language inflection graphs

Science.gov (United States)

Fukś, Henryk; Farzad, Babak; Cao, Yi

2014-01-01

Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to the abundance of inflectional forms. We construct the simplest form of inflection graphs, namely a bipartite graph in which one group of vertices corresponds to dictionary headwords and the other group to inflected forms encountered in a given text. We, then, study projection of this graph on the set of headwords. The projection decomposes into a large number of connected components, to be called word groups. Distribution of sizes of word group exhibits some remarkable properties, resembling cluster distribution in a lattice percolation near the critical point. We propose a simple model which produces graphs of this type, reproducing the desired component distribution and other topological features.

Graph processing platforms at scale: practices and experiences

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [ORNL; Lee, Sangkeun (Matt) [ORNL; Brown, Tyler C [ORNL; Sukumar, Sreenivas R [ORNL; Ganesh, Gautam [ORNL

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.

Cyber Graph Queries for Geographically Distributed Data Centers

Energy Technology Data Exchange (ETDEWEB)

Berry, Jonathan W. [Mail Stop, Albuquerque, NM (United States); Collins, Michael [Christopher Newport Univ., VA (United States); Kearns, Aaron [Univ. of New Mexico, Albuquerque, NM (United States); Phillips, Cynthia A. [Mail Stop, Albuquerque, NM (United States); Saia, Jared [Univ. of New Mexico, Albuquerque, NM (United States)

2015-05-01

We present new algorithms for a distributed model for graph computations motivated by limited information sharing we first discussed in [20]. Two or more independent entities have collected large social graphs. They wish to compute the result of running graph algorithms on the entire set of relationships. Because the information is sensitive or economically valuable, they do not wish to simply combine the information in a single location. We consider two models for computing the solution to graph algorithms in this setting: 1) limited-sharing: the two entities can share only a polylogarithmic size subgraph; 2) low-trust: the entities must not reveal any information beyond the query answer, assuming they are all honest but curious. We believe this model captures realistic constraints on cooperating autonomous data centers. We have algorithms in both setting for s - t connectivity in both models. We also give an algorithm in the low-communication model for finding a planted clique. This is an anomaly- detection problem, finding a subgraph that is larger and denser than expected. For both the low- communication algorithms, we exploit structural properties of social networks to prove perfor- mance bounds better than what is possible for general graphs. For s - t connectivity, we use known properties. For planted clique, we propose a new property: bounded number of triangles per node. This property is based upon evidence from the social science literature. We found that classic examples of social networks do not have the bounded-triangles property. This is because many social networks contain elements that are non-human, such as accounts for a business, or other automated accounts. We describe some initial attempts to distinguish human nodes from automated nodes in social networks based only on topological properties.

A set of enhanced green fluorescent protein concatemers for quantitative determination of nuclear localization signal strength.

Science.gov (United States)

Böhm, Jennifer; Thavaraja, Ramya; Giehler, Susanne; Nalaskowski, Marcus M

2017-09-15

Regulated transport of proteins between nucleus and cytoplasm is an important process in the eukaryotic cell. In most cases, active nucleo-cytoplasmic protein transport is mediated by nuclear localization signal (NLS) and/or nuclear export signal (NES) motifs. In this study, we developed a set of vectors expressing enhanced GFP (EGFP) concatemers ranging from 2 to 12 subunits (2xEGFP to 12xEGFP) for analysis of NLS strength. As shown by in gel GFP fluorescence analysis and αGFP Western blotting, EGFP concatemers are expressed as fluorescent full-length proteins in eukaryotic cells. As expected, nuclear localization of concatemeric EGFPs decreases with increasing molecular weight. By oligonucleotide ligation this set of EGFP concatemers can be easily fused to NLS motifs. After determination of intracellular localization of EGFP concatemers alone and fused to different NLS motifs we calculated the size of a hypothetic EGFP concatemer showing a defined distribution of EGFP fluorescence between nucleus and cytoplasm (n/c ratio = 2). Clear differences of the size of the hypothetic EGFP concatemer depending on the fused NLS motif were observed. Therefore, we propose to use the size of this hypothetic concatemer as quantitative indicator for comparing strength of different NLS motifs. Copyright © 2017 Elsevier Inc. All rights reserved.

Graph theoretical model of a sensorimotor connectome in zebrafish.

Science.gov (United States)

Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

2012-01-01

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

On characterizing terrain visibility graphs

Directory of Open Access Journals (Sweden)

William Evans

2015-06-01

Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.

Open Graphs and Computational Reasoning

Directory of Open Access Journals (Sweden)

Lucas Dixon

2010-06-01

Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.

Evolutionarily conserved bias of amino-acid usage refines the definition of PDZ-binding motif

Directory of Open Access Journals (Sweden)

Launey Thomas

2011-06-01

Full Text Available Abstract Background The interactions between PDZ (PSD-95, Dlg, ZO-1 domains and PDZ-binding motifs play central roles in signal transductions within cells. Proteins with PDZ domains bind to PDZ-binding motifs almost exclusively when the motifs are located at the carboxyl (C- terminal ends of their binding partners. However, it remains little explored whether PDZ-binding motifs show any preferential location at the C-terminal ends of proteins, at genome-level. Results Here, we examined the distribution of the type-I (x-x-S/T-x-I/L/V or type-II (x-x-V-x-I/V PDZ-binding motifs in proteins encoded in the genomes of five different species (human, mouse, zebrafish, fruit fly and nematode. We first established that these PDZ-binding motifs are indeed preferentially present at their C-terminal ends. Moreover, we found specific amino acid (AA bias for the 'x' positions in the motifs at the C-terminal ends. In general, hydrophilic AAs were favored. Our genomics-based findings confirm and largely extend the results of previous interaction-based studies, allowing us to propose refined consensus sequences for all of the examined PDZ-binding motifs. An ontological analysis revealed that the refined motifs are functionally relevant since a large fraction of the proteins bearing the motif appear to be involved in signal transduction. Furthermore, co-precipitation experiments confirmed two new protein interactions predicted by our genomics-based approach. Finally, we show that influenza virus pathogenicity can be correlated with PDZ-binding motif, with high-virulence viral proteins bearing a refined PDZ-binding motif. Conclusions Our refined definition of PDZ-binding motifs should provide important clues for identifying functional PDZ-binding motifs and proteins involved in signal transduction.

Kopi dan Kakao dalam Kreasi Motif Batik Khas Jember

Directory of Open Access Journals (Sweden)

Irfa'ina Rohana Salma

2015-06-01

Full Text Available ABSTRAK Batik Jember selama ini identik dengan motif daun tembakau. Visualisasi daun tembakau dalam motif Batik Jember cukup lemah, yaitu kurang berkarakter karena motif yang muncul adalah seperti gambar daun pada umumnya. Oleh karena itu perlu diciptakan desain motif batik khas Jember yang sumber inspirasinya digali dari kekayaan alam lainnya dari Jember yang mempunyai bentuk spesifik dan karakteristik sehingga identitas motif bisa didapatkan dengan lebih kuat. Hasil alam khas Jember tersebut adalah kopi dan kakao. Tujuan penciptaan seni ini adalah untuk menghasilkan motif batik  baru yang mempunyai ciri khas Jember. Metode yang digunakan yaitu pengumpulan data, pengamatan mendalam terhadap objek penciptaan, pengkajian sumber inspirasi, pembuatan desain motif, dan perwujudan menjadi batik. Dari penciptaan seni ini berhasil dikreasikan 6 (enam motif batik yaitu: (1 Motif Uwoh Kopi; (2 Motif Godong Kopi;  (3 Motif Ceplok Kakao; (4 Motif Kakao Raja; (5 Motif Kakao Biru; dan (6 Motif Wiji Mukti. Berdasarkan hasil penilaian “Selera Estetika” diketahui bahwa motif yang paling banyak disukai adalah Motif Uwoh Kopi dan Motif Kakao Raja. Kata kunci: Motif Woh Kopi, Motif Godong Kopi, Motif Ceplok Kakao, Motif Kakao Raja, Motif Kakao Biru, Motif Wiji Mukti ABSTRACTBatik Jember is synonymous with tobacco leaf motif. Tobacco leaf shape is quite weak in the visual appearance characterized as that motif emerges like a picture of leaves in general. Therefore, it is necessary to create a distinctive design motif extracted from other natural resources of Jember that have specific shapes and characteristics that can be obtained as the stronger motif identity. The typical natural resources from Jember are coffee and cocoa. The purpose of the creation of this art is to produce the unique, creative and innovative batik and have specific characteristics of Jember. The method used are data collection, observation of the object, reviewing inspiration sources

Edge Cut Domination, Irredundance, and Independence in Graphs

OpenAIRE

Fenstermacher, Todd; Hedetniemi, Stephen; Laskar, Renu

2016-01-01

An edge dominating set $F$ of a graph $G=(V,E)$ is an \\textit{edge cut dominating set} if the subgraph $\\langle V,G-F \\rangle$ is disconnected. The \\textit{edge cut domination number} $\\gamma_{ct}(G)$ of $G$ is the minimum cardinality of an edge cut dominating set of $G.$ In this paper we study the edge cut domination number and investigate its relationships with other parameters of graphs. We also introduce the properties edge cut irredundance and edge cut independence.

A set of tetra-nucleotide core motif SSR markers for efficient identification of potato (Solanum tuberosum) cultivars.

Science.gov (United States)

Kishine, Masahiro; Tsutsumi, Katsuji; Kitta, Kazumi

2017-12-01

Simple sequence repeat (SSR) is a popular tool for individual fingerprinting. The long-core motif (e.g. tetra-, penta-, and hexa-nucleotide) simple sequence repeats (SSRs) are preferred because they make it easier to separate and distinguish neighbor alleles. In the present study, a new set of 8 tetra-nucleotide SSRs in potato ( Solanum tuberosum ) is reported. By using these 8 markers, 72 out of 76 cultivars obtained from Japan and the United States were clearly discriminated, while two pairs, both of which arose from natural variation, showed identical profiles. The combined probability of identity between two random cultivars for the set of 8 SSR markers was estimated to be 1.10 × 10 -8 , confirming the usefulness of the proposed SSR markers for fingerprinting analyses of potato.

The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets

OpenAIRE

Brevik, John O.; O'Sullivan, Michael E.

2014-01-01

The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the convergence of the algorithm are derived and applied to trapping sets.

Some Results on the Intersection Graphs of Ideals of Rings

International Nuclear Information System (INIS)

Akbari, S.; Nikandish, R.; Nikmehr, M.J.

2010-08-01

Let R be a ring with unity and I(R)* be the set of all non-trivial left ideals of R. The intersection graph of ideals of R, denoted by G(R), is a graph with the vertex set I(R)* and two distinct vertices I and J are adjacent if and only if I intersection J ≠ 0. In this paper, we study some connections between the graph-theoretic properties of this graph and some algebraic properties of rings. We characterize all rings whose intersection graphs of ideals are not connected. Also we determine all rings whose clique number of the intersection graphs of ideals are finite. Among other results, it is shown that for every ring, if the clique number of G(R) is finite, then the chromatic number is finite too and if R is a reduced ring both are equal. (author)

Distances in zero-divisor and total graphs from commutative rings–A survey

Directory of Open Access Journals (Sweden)

T. Tamizh Chelvam

2016-12-01

Full Text Available There are so many ways to construct graphs from algebraic structures. Most popular constructions are Cayley graphs, commuting graphs and non-commuting graphs from finite groups and zero-divisor graphs and total graphs from commutative rings. For a commutative ring R with non-zero identity, we denote the set of zero-divisors and unit elements of R by Z(R and U(R, respectively. One of the associated graphs to a ring R is the zero-divisor graph; it is a simple graph with vertex set Z(R∖{0}, and two vertices x and y are adjacent if and only if xy=0. This graph was first introduced by Beck, where all the elements of R are considered as the vertices. Anderson and Badawi, introduced the total graph of R, as the simple graph with all elements of R as vertices, and two distinct vertices x and y are adjacent if and only if x+y∈Z(R. For a given graph G, the concept of connectedness, diameter and girth are always of great interest. Several authors extensively studied about the zero-divisor and total graphs from commutative rings. In this paper, we present a survey of results obtained with regard to distances in zero-divisor and total graphs.

Low-Rank Matrix Factorization With Adaptive Graph Regularizer.

Science.gov (United States)

Lu, Gui-Fu; Wang, Yong; Zou, Jian

2016-05-01

In this paper, we present a novel low-rank matrix factorization algorithm with adaptive graph regularizer (LMFAGR). We extend the recently proposed low-rank matrix with manifold regularization (MMF) method with an adaptive regularizer. Different from MMF, which constructs an affinity graph in advance, LMFAGR can simultaneously seek graph weight matrix and low-dimensional representations of data. That is, graph construction and low-rank matrix factorization are incorporated into a unified framework, which results in an automatically updated graph rather than a predefined one. The experimental results on some data sets demonstrate that the proposed algorithm outperforms the state-of-the-art low-rank matrix factorization methods.

Determining X-chains in graph states

International Nuclear Information System (INIS)

Wu, Jun-Yi; Kampermann, Hermann; Bruß, Dagmar

2016-01-01

The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-chains (Wu et al 2015 Phys. Rev. A 92 012322). We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by the Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states. (paper)

Applications of Graph Spectral Techniques to Water Distribution Network Management

Directory of Open Access Journals (Sweden)

Armando di Nardo

2018-01-01

Full Text Available Cities depend on multiple heterogeneous, interconnected infrastructures to provide safe water to consumers. Given this complexity, efficient numerical techniques are needed to support optimal control and management of a water distribution network (WDN. This paper introduces a holistic analysis framework to support water utilities on the decision making process for an efficient supply management. The proposal is based on graph spectral techniques that take advantage of eigenvalues and eigenvectors properties of matrices that are associated with graphs. Instances of these matrices are the adjacency matrix and the Laplacian, among others. The interest for this application is to work on a graph that specifically represents a WDN. This is a complex network that is made by nodes corresponding to water sources and consumption points and links corresponding to pipes and valves. The aim is to face new challenges on urban water supply, ranging from computing approximations for network performance assessment to setting device positioning for efficient and automatic WDN division into district metered areas. It is consequently created a novel tool-set of graph spectral techniques adapted to improve main water management tasks and to simplify the identification of water losses through the definition of an optimal network partitioning. Two WDNs are used to analyze the proposed methodology. Firstly, the well-known network of C-Town is investigated for benchmarking of the proposed graph spectral framework. This allows for comparing the obtained results with others coming from previously proposed approaches in literature. The second case-study corresponds to an operational network. It shows the usefulness and optimality of the proposal to effectively manage a WDN.

Graph-related optimization and decision support systems

CERN Document Server

Krichen, Saoussen

2014-01-01

Constrained optimization is a challenging branch of operations research that aims to create a model which has a wide range of applications in the supply chain, telecommunications and medical fields. As the problem structure is split into two main components, the objective is to accomplish the feasible set framed by the system constraints. The aim of this book is expose optimization problems that can be expressed as graphs, by detailing, for each studied problem, the set of nodes and the set of edges.  This graph modeling is an incentive for designing a platform that integrates all optimizatio

Suppressive oligodeoxynucleotides containing TTAGGG motifs inhibit cGAS activation in human monocytes.

Science.gov (United States)

Steinhagen, Folkert; Zillinger, Thomas; Peukert, Konrad; Fox, Mario; Thudium, Marcus; Barchet, Winfried; Putensen, Christian; Klinman, Dennis; Latz, Eicke; Bode, Christian

2018-04-01

Type I interferon (IFN) is a critical mediator of autoimmune diseases such as systemic lupus erythematosus (SLE) and Aicardi-Goutières Syndrome (AGS). The recently discovered cyclic-GMP-AMP (cGAMP) synthase (cGAS) induces the production of type I IFN in response to cytosolic DNA and is potentially linked to SLE and AGS. Suppressive oligodeoxynucleotides (ODN) containing repetitive TTAGGG motifs present in mammalian telomeres have proven useful in the treatment of autoimmune diseases including SLE. In this study, we demonstrate that the suppressive ODN A151 effectively inhibits activation of cGAS in response to cytosolic DNA, thereby inhibiting type I IFN production by human monocytes. In addition, A151 abrogated cGAS activation in response to endogenous accumulation of DNA using TREX1-deficient monocytes. We demonstrate that A151 prevents cGAS activation in a manner that is competitive with DNA. This suppressive activity of A151 was dependent on both telomeric sequence and phosphorothioate backbone. To our knowledge this report presents the first cGAS inhibitor capable of blocking self-DNA. Collectively, these findings might lead to the development of new therapeutics against IFN-driven pathologies due to cGAS activation. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Conserved EAR Motif Is Required for Avirulence and Stability of the Ralstonia solanacearum Effector PopP2 In Planta

Directory of Open Access Journals (Sweden)

Cécile Segonzac

2017-08-01

Full Text Available Ralstonia solanacearum is the causal agent of the devastating bacterial wilt disease in many high value Solanaceae crops. R. solanacearum secretes around 70 effectors into host cells in order to promote infection. Plants have, however, evolved specialized immune receptors that recognize corresponding effectors and confer qualitative disease resistance. In the model species Arabidopsis thaliana, the paired immune receptors RRS1 (resistance to Ralstonia solanacearum 1 and RPS4 (resistance to Pseudomonas syringae 4 cooperatively recognize the R. solanacearum effector PopP2 in the nuclei of infected cells. PopP2 is an acetyltransferase that binds to and acetylates the RRS1 WRKY DNA-binding domain resulting in reduced RRS1-DNA association thereby activating plant immunity. Here, we surveyed the naturally occurring variation in PopP2 sequence among the R. solanacearum strains isolated from diseased tomato and pepper fields across the Republic of Korea. Our analysis revealed high conservation of popP2 sequence with only three polymorphic alleles present amongst 17 strains. Only one variation (a premature stop codon caused the loss of RPS4/RRS1-dependent recognition in Arabidopsis. We also found that PopP2 harbors a putative eukaryotic transcriptional repressor motif (ethylene-responsive element binding factor-associated amphiphilic repression or EAR, which is known to be involved in the recruitment of transcriptional co-repressors. Remarkably, mutation of the EAR motif disabled PopP2 avirulence function as measured by the development of hypersensitive response, electrolyte leakage, defense marker gene expression and bacterial growth in Arabidopsis. This lack of recognition was partially but significantly reverted by the C-terminal addition of a synthetic EAR motif. We show that the EAR motif-dependent gain of avirulence correlated with the stability of the PopP2 protein. Furthermore, we demonstrated the requirement of the PopP2 EAR motif for PTI

Measuring Two-Event Structural Correlations on Graphs

Science.gov (United States)

2012-08-01

2012 to 00-00-2012 4. TITLE AND SUBTITLE Measuring Two-Event Structural Correlations on Graphs 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ...by event simulation on the DBLP graph. Then we examine the efficiency and scala - bility of the framework with a Twitter network. The third part of...correlation pattern mining for large graphs. In Proc. of the 8th Workshop on Mining and Learning with Graphs, pages 119–126, 2010. [23] T. Smith. A

The nature of hydrogen bonding in R-2(2)(8) crystal motifs - a computational exploration

Czech Academy of Sciences Publication Activity Database

Deepa, Palanisamy; Solomon, R. V.; Vedha, S. A.; Kolandaivel, P.; Venuvanalingam, P.

2014-01-01

Roč. 112, č. 24 (2014), s. 3195-3205 ISSN 0026-8976 Institutional support: RVO:61388963 Keywords : NCI plot * hydrogen bonds * R-2(2)(8) motif * organic crystals * NBO * QTAIM analysis Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 1.720, year: 2014

Some results on square-free colorings of graphs

DEFF Research Database (Denmark)

Barat, Janos

2004-01-01

on the vertices or edges of a path. Conversely one can form sequences from a vertex or edge coloring of a graph in different ways. Thus there are several possibilities to generalize the square-free concept to graphs. Following Alon, Grytczuk, Haluszczak, Riordan and Bresar, Klavzar we study several so called...... square-free graph parameters, and answer some questions they posed. The main result is that the class of k-trees has bounded square-free vertex coloring parameter. Thus we can color the vertices of a k-tree using O(c^k) colors if c>6 such that the color sequence on any path is square......-free. It is conjectured that a similar phenomenon holds for planar graphs, so a finite number of colors are enough. We support this conjecture by showing that this number is at most 12 for outerplanar graphs. On the other hand we prove that some outerplanar graphs require at least 7 colors. Using this latter we construct...

A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Directory of Open Access Journals (Sweden)

Jean Chamberlain Chedjou

2015-01-01

Full Text Available This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest path problem solver. The proposed mathematical model is characterized by three fundamental parameters expressing (a the graph topology (through the “incidence matrix”, (b the edge weights (with dynamic external weights’ setting capability, and (c the dynamic reconfigurability through external input(s of the source-destination nodes pair. In order to demonstrate the universality of the developed concept, a general algorithm is proposed to determine the three fundamental parameters (of the mathematical model developed for all types of graphs regardless of their topology, magnitude, and size. It is demonstrated that the main advantage of the developed concept is that arc costs, the origin-destination pair setting, and the graph topology are dynamically provided by external commands, which are inputs of the shortest path solver model. This enables high flexibility and full reconfigurability of the developed concept, without any retraining need. To validate the concept developed, benchmarking is performed leading to a comparison of its performance with the performances of two well-known concepts based on neural networks.

Graph theoretical model of a sensorimotor connectome in zebrafish.

Directory of Open Access Journals (Sweden)

Michael Stobb

Full Text Available Mapping the detailed connectivity patterns (connectomes of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

A graph rewriting programming language for graph drawing

OpenAIRE

Rodgers, Peter

1998-01-01

This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

On Merrifield-Simmons index of molecular graphs

Directory of Open Access Journals (Sweden)

Gutman Ivan

2016-01-01

Full Text Available The Merrifield-Simmons index σ = σ(G of a graph G is the number of independent vertex sets of G. This index can be calculated recursively and expressed in terms of Fibonacci numbers. We determine the molecular graphs for which σ can be recursively calculated in a single step.

Incremental Frequent Subgraph Mining on Large Evolving Graphs

KAUST Repository

Abdelhamid, Ehab

2017-08-22

Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. We adapt the notion of “fringe” to the graph context, that is the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.

Analyzing and synthesizing phylogenies using tree alignment graphs.

Directory of Open Access Journals (Sweden)

Stephen A Smith

Full Text Available Phylogenetic trees are used to analyze and visualize evolution. However, trees can be imperfect datatypes when summarizing multiple trees. This is especially problematic when accommodating for biological phenomena such as horizontal gene transfer, incomplete lineage sorting, and hybridization, as well as topological conflict between datasets. Additionally, researchers may want to combine information from sets of trees that have partially overlapping taxon sets. To address the problem of analyzing sets of trees with conflicting relationships and partially overlapping taxon sets, we introduce methods for aligning, synthesizing and analyzing rooted phylogenetic trees within a graph, called a tree alignment graph (TAG. The TAG can be queried and analyzed to explore uncertainty and conflict. It can also be synthesized to construct trees, presenting an alternative to supertrees approaches. We demonstrate these methods with two empirical datasets. In order to explore uncertainty, we constructed a TAG of the bootstrap trees from the Angiosperm Tree of Life project. Analysis of the resulting graph demonstrates that areas of the dataset that are unresolved in majority-rule consensus tree analyses can be understood in more detail within the context of a graph structure, using measures incorporating node degree and adjacency support. As an exercise in synthesis (i.e., summarization of a TAG constructed from the alignment trees, we also construct a TAG consisting of the taxonomy and source trees from a recent comprehensive bird study. We synthesized this graph into a tree that can be reconstructed in a repeatable fashion and where the underlying source information can be updated. The methods presented here are tractable for large scale analyses and serve as a basis for an alternative to consensus tree and supertree methods. Furthermore, the exploration of these graphs can expose structures and patterns within the dataset that are otherwise difficult to

Analyzing and synthesizing phylogenies using tree alignment graphs.

Science.gov (United States)

Smith, Stephen A; Brown, Joseph W; Hinchliff, Cody E

2013-01-01

Phylogenetic trees are used to analyze and visualize evolution. However, trees can be imperfect datatypes when summarizing multiple trees. This is especially problematic when accommodating for biological phenomena such as horizontal gene transfer, incomplete lineage sorting, and hybridization, as well as topological conflict between datasets. Additionally, researchers may want to combine information from sets of trees that have partially overlapping taxon sets. To address the problem of analyzing sets of trees with conflicting relationships and partially overlapping taxon sets, we introduce methods for aligning, synthesizing and analyzing rooted phylogenetic trees within a graph, called a tree alignment graph (TAG). The TAG can be queried and analyzed to explore uncertainty and conflict. It can also be synthesized to construct trees, presenting an alternative to supertrees approaches. We demonstrate these methods with two empirical datasets. In order to explore uncertainty, we constructed a TAG of the bootstrap trees from the Angiosperm Tree of Life project. Analysis of the resulting graph demonstrates that areas of the dataset that are unresolved in majority-rule consensus tree analyses can be understood in more detail within the context of a graph structure, using measures incorporating node degree and adjacency support. As an exercise in synthesis (i.e., summarization of a TAG constructed from the alignment trees), we also construct a TAG consisting of the taxonomy and source trees from a recent comprehensive bird study. We synthesized this graph into a tree that can be reconstructed in a repeatable fashion and where the underlying source information can be updated. The methods presented here are tractable for large scale analyses and serve as a basis for an alternative to consensus tree and supertree methods. Furthermore, the exploration of these graphs can expose structures and patterns within the dataset that are otherwise difficult to observe.

Motif finding in DNA sequences based on skipping nonconserved positions in background Markov chains.

Science.gov (United States)

Zhao, Xiaoyan; Sze, Sing-Hoi

2011-05-01

One strategy to identify transcription factor binding sites is through motif finding in upstream DNA sequences of potentially co-regulated genes. Despite extensive efforts, none of the existing algorithms perform very well. We consider a string representation that allows arbitrary ignored positions within the nonconserved portion of single motifs, and use O(2(l)) Markov chains to model the background distributions of motifs of length l while skipping these positions within each Markov chain. By focusing initially on positions that have fixed nucleotides to define core occurrences, we develop an algorithm to identify motifs of moderate lengths. We compare the performance of our algorithm to other motif finding algorithms on a few benchmark data sets, and show that significant improvement in accuracy can be obtained when the sites are sufficiently conserved within a given sample, while comparable performance is obtained when the site conservation rate is low. A software program (PosMotif ) and detailed results are available online at http://faculty.cse.tamu.edu/shsze/posmotif.

Aberrant Receptor Internalization and Enhanced FRS2-dependent Signaling Contribute to the Transforming Activity of the Fibroblast Growth Factor Receptor 2 IIIb C3 Isoform*

Science.gov (United States)

Cha, Jiyoung Y.; Maddileti, Savitri; Mitin, Natalia; Harden, T. Kendall; Der, Channing J.

2009-01-01

Alternative splice variants of fibroblast growth factor receptor 2 (FGFR2) IIIb, designated C1, C2, and C3, possess progressive reduction in their cytoplasmic carboxyl termini (822, 788, and 769 residues, respectively), with preferential expression of the C2 and C3 isoforms in human cancers. We determined that the progressive deletion of carboxyl-terminal sequences correlated with increasing transforming potency. The highly transforming C3 variant lacks five tyrosine residues present in C1, and we determined that the loss of Tyr-770 alone enhanced FGFR2 IIIb C1 transforming activity. Because Tyr-770 may compose a putative YXXL sorting motif, we hypothesized that loss of Tyr-770 in the 770YXXL motif may cause disruption of FGFR2 IIIb C1 internalization and enhance transforming activity. Surprisingly, we found that mutation of Leu-773 but not Tyr-770 impaired receptor internalization and increased receptor stability and activation. Interestingly, concurrent mutations of Tyr-770 and Leu-773 caused 2-fold higher transforming activity than caused by the Y770F or L773A single mutations, suggesting loss of Tyr and Leu residues of the 770YXXL773 motif enhances FGFR2 IIIb transforming activity by distinct mechanisms. We also determined that loss of Tyr-770 caused persistent activation of FRS2 by enhancing FRS2 binding to FGFR2 IIIb. Furthermore, we found that FRS2 binding to FGFR2 IIIb is required for increased FRS2 tyrosine phosphorylation and enhanced transforming activity by Y770F mutation. Our data support a dual mechanism where deletion of the 770YXXL773 motif promotes FGFR2 IIIb C3 transforming activity by causing aberrant receptor recycling and stability and persistent FRS2-dependent signaling. PMID:19103595

Two-colorable graph states with maximal Schmidt measure

International Nuclear Information System (INIS)

Severini, Simone

2006-01-01

The Schmidt measure was introduced by Eisert and Briegel for quantifying the degree of entanglement of multipartite quantum systems [J. Eisert, H.-J. Briegel, Phys. Rev. A 64 (2001) 22306]. For two-colorable graph states, the Schmidt measure is related to the spectrum of the associated graph. We observe that almost all two-colorable graph states have maximal Schmidt measure and we construct specific examples. By making appeal to a result of Ehrenfeucht et al. [A. Ehrenfeucht, T. Harju, G. Rozenberg, Discrete Math. 278 (2004) 45], we point out that the graph operations called local complementation and switching form a transitive group acting on the set of all graph states of a given dimension

Using graph theory for automated electric circuit solving

International Nuclear Information System (INIS)

Toscano, L; Stella, S; Milotti, E

2015-01-01

Graph theory plays many important roles in modern physics and in many different contexts, spanning diverse topics such as the description of scale-free networks and the structure of the universe as a complex directed graph in causal set theory. Graph theory is also ideally suited to describe many concepts in computer science. Therefore it is increasingly important for physics students to master the basic concepts of graph theory. Here we describe a student project where we develop a computational approach to electric circuit solving which is based on graph theoretic concepts. This highly multidisciplinary approach combines abstract mathematics, linear algebra, the physics of circuits, and computer programming to reach the ambitious goal of implementing automated circuit solving. (paper)

Enabling Graph Appliance for Genome Assembly

Energy Technology Data Exchange (ETDEWEB)

Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

2015-01-01

In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

Several classes of graphs and their r-dynamic chromatic numbers

Science.gov (United States)

Dafik; Meganingtyas, D. E. W.; Dwidja Purnomo, K.; Dicky Tarmidzi, M.; Hesti Agustin, Ika

2017-06-01

Let G be a simple, connected and undirected graph. Let r, k be natural numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive different colors. An r-dynamic k-coloring is a proper k-coloring c of G such that |c(N(v))| ≥ min{r, d(v)} for each vertex v in V (G), where N(v) is the neighborhood of v and c(S) = {c(v) : v ∈ S} for a vertex subset S. The r-dynamic chromatic number, written as χ r (G), is the minimum k such that G has an r-dynamic k-coloring. By simple observation it is easy to see that χ r (G) ≤ χ r+1(G), however χ r+1(G) - χ r (G) does not always show a small difference for any r. Thus, finding an exact value of χ r (G) is significantly useful. In this paper, we will study some of them especially when G are prism graph, three-cyclical ladder graph, joint graph and circulant graph.

Highly scalable Ab initio genomic motif identification

KAUST Repository

Marchand, Benoit; Bajic, Vladimir B.; Kaushik, Dinesh

2011-01-01

We present results of scaling an ab initio motif family identification system, Dragon Motif Finder (DMF), to 65,536 processor cores of IBM Blue Gene/P. DMF seeks groups of mutually similar polynucleotide patterns within a set of genomic sequences and builds various motif families from them. Such information is of relevance to many problems in life sciences. Prior attempts to scale such ab initio motif-finding algorithms achieved limited success. We solve the scalability issues using a combination of mixed-mode MPI-OpenMP parallel programming, master-slave work assignment, multi-level workload distribution, multi-level MPI collectives, and serial optimizations. While the scalability of our algorithm was excellent (94% parallel efficiency on 65,536 cores relative to 256 cores on a modest-size problem), the final speedup with respect to the original serial code exceeded 250,000 when serial optimizations are included. This enabled us to carry out many large-scale ab initio motiffinding simulations in a few hours while the original serial code would have needed decades of execution time. Copyright 2011 ACM.

An example of numerical simulation in causal set dynamics

International Nuclear Information System (INIS)

Krugly, Alexey L; Tserkovnikov, Ivan A

2013-01-01

The model of a discrete pregeometry on a microscopic scale is an x-graph. This is a directed acyclic graph. An outdegree and an indegree of each vertex are not more than 2. The sets of vertices and edges of x-graph are particular cases of causal sets. The sequential growth of a graph is an addition of new vertices one by one. A simple stochastic algorithm of sequential growth of x-graph are considered. It is based on a random walk at the x-graph. The particles in this model must be self-organized repetitive structures. We introduce the method of search of such repetitive structures. It is based on a discrete Fourier transformation. An example of numerical simulation is introduced.

Probabilistic Graph Layout for Uncertain Network Visualization.

Science.gov (United States)

Schulz, Christoph; Nocaj, Arlind; Goertler, Jochen; Deussen, Oliver; Brandes, Ulrik; Weiskopf, Daniel

2017-01-01

We present a novel uncertain network visualization technique based on node-link diagrams. Nodes expand spatially in our probabilistic graph layout, depending on the underlying probability distributions of edges. The visualization is created by computing a two-dimensional graph embedding that combines samples from the probabilistic graph. A Monte Carlo process is used to decompose a probabilistic graph into its possible instances and to continue with our graph layout technique. Splatting and edge bundling are used to visualize point clouds and network topology. The results provide insights into probability distributions for the entire network-not only for individual nodes and edges. We validate our approach using three data sets that represent a wide range of network types: synthetic data, protein-protein interactions from the STRING database, and travel times extracted from Google Maps. Our approach reveals general limitations of the force-directed layout and allows the user to recognize that some nodes of the graph are at a specific position just by chance.

Optimizing graph algorithms on pregel-like systems

KAUST Repository

Salihoglu, Semih

2014-03-01

We study the problem of implementing graph algorithms efficiently on Pregel-like systems, which can be surprisingly challenging. Standard graph algorithms in this setting can incur unnecessary inefficiencies such as slow convergence or high communication or computation cost, typically due to structural properties of the input graphs such as large diameters or skew in component sizes. We describe several optimization techniques to address these inefficiencies. Our most general technique is based on the idea of performing some serial computation on a tiny fraction of the input graph, complementing Pregel\\'s vertex-centric parallelism. We base our study on thorough implementations of several fundamental graph algorithms, some of which have, to the best of our knowledge, not been implemented on Pregel-like systems before. The algorithms and optimizations we describe are fully implemented in our open-source Pregel implementation. We present detailed experiments showing that our optimization techniques improve runtime significantly on a variety of very large graph datasets.

A Pyranose-2-Phosphate Motif Is Responsible for Both Antibiotic Import and Quorum-Sensing Regulation in Agrobacterium tumefaciens.

Directory of Open Access Journals (Sweden)

Abbas El Sahili

2015-08-01

Full Text Available Periplasmic binding proteins (PBPs in association with ABC transporters select and import a wide variety of ligands into bacterial cytoplasm. They can also take up toxic molecules, as observed in the case of the phytopathogen Agrobacterium tumefaciens strain C58. This organism contains a PBP called AccA that mediates the import of the antibiotic agrocin 84, as well as the opine agrocinopine A that acts as both a nutrient and a signalling molecule for the dissemination of virulence genes through quorum-sensing. Here, we characterized the binding mode of AccA using purified agrocin 84 and synthetic agrocinopine A by X-ray crystallography at very high resolution and performed affinity measurements. Structural and affinity analyses revealed that AccA recognizes an uncommon and specific motif, a pyranose-2-phosphate moiety which is present in both imported molecules via the L-arabinopyranose moiety in agrocinopine A and the D-glucopyranose moiety in agrocin 84. We hypothesized that AccA is a gateway allowing the import of any compound possessing a pyranose-2-phosphate motif at one end. This was structurally and functionally confirmed by experiments using four synthetic compounds: agrocinopine 3'-O-benzoate, L-arabinose-2-isopropylphosphate, L-arabinose-2-phosphate and D-glucose-2-phosphate. By combining affinity measurements and in vivo assays, we demonstrated that both L-arabinose-2-phosphate and D-glucose-2-phosphate, which are the AccF mediated degradation products of agrocinopine A and agrocin 84 respectively, interact with the master transcriptional regulator AccR and activate the quorum-sensing signal synthesis and Ti plasmid transfer in A. tumefaciens C58. Our findings shed light on the role of agrocinopine and antibiotic agrocin 84 on quorum-sensing regulation in A. tumefaciens and reveal how the PBP AccA acts as vehicle for the importation of both molecules by means of a key-recognition motif. It also opens future possibilities for the

A Pyranose-2-Phosphate Motif Is Responsible for Both Antibiotic Import and Quorum-Sensing Regulation in Agrobacterium tumefaciens.

Science.gov (United States)

El Sahili, Abbas; Li, Si-Zhe; Lang, Julien; Virus, Cornelia; Planamente, Sara; Ahmar, Mohammed; Guimaraes, Beatriz G; Aumont-Nicaise, Magali; Vigouroux, Armelle; Soulère, Laurent; Reader, John; Queneau, Yves; Faure, Denis; Moréra, Solange

2015-08-01

Periplasmic binding proteins (PBPs) in association with ABC transporters select and import a wide variety of ligands into bacterial cytoplasm. They can also take up toxic molecules, as observed in the case of the phytopathogen Agrobacterium tumefaciens strain C58. This organism contains a PBP called AccA that mediates the import of the antibiotic agrocin 84, as well as the opine agrocinopine A that acts as both a nutrient and a signalling molecule for the dissemination of virulence genes through quorum-sensing. Here, we characterized the binding mode of AccA using purified agrocin 84 and synthetic agrocinopine A by X-ray crystallography at very high resolution and performed affinity measurements. Structural and affinity analyses revealed that AccA recognizes an uncommon and specific motif, a pyranose-2-phosphate moiety which is present in both imported molecules via the L-arabinopyranose moiety in agrocinopine A and the D-glucopyranose moiety in agrocin 84. We hypothesized that AccA is a gateway allowing the import of any compound possessing a pyranose-2-phosphate motif at one end. This was structurally and functionally confirmed by experiments using four synthetic compounds: agrocinopine 3'-O-benzoate, L-arabinose-2-isopropylphosphate, L-arabinose-2-phosphate and D-glucose-2-phosphate. By combining affinity measurements and in vivo assays, we demonstrated that both L-arabinose-2-phosphate and D-glucose-2-phosphate, which are the AccF mediated degradation products of agrocinopine A and agrocin 84 respectively, interact with the master transcriptional regulator AccR and activate the quorum-sensing signal synthesis and Ti plasmid transfer in A. tumefaciens C58. Our findings shed light on the role of agrocinopine and antibiotic agrocin 84 on quorum-sensing regulation in A. tumefaciens and reveal how the PBP AccA acts as vehicle for the importation of both molecules by means of a key-recognition motif. It also opens future possibilities for the rational design of

Distinct repeat motifs at the C-terminal region of CagA of Helicobacter pylori strains isolated from diseased patients and asymptomatic individuals in West Bengal, India

Directory of Open Access Journals (Sweden)

Chattopadhyay Santanu

2012-05-01

Full Text Available Abstract Background Infection with Helicobacter pylori strains that express CagA is associated with gastritis, peptic ulcer disease, and gastric adenocarcinoma. The biological function of CagA depends on tyrosine phosphorylation by a cellular kinase. The phosphate acceptor tyrosine moiety is present within the EPIYA motif at the C-terminal region of the protein. This region is highly polymorphic due to variations in the number of EPIYA motifs and the polymorphism found in spacer regions among EPIYA motifs. The aim of this study was to analyze the polymorphism at the C-terminal end of CagA and to evaluate its association with the clinical status of the host in West Bengal, India. Results Seventy-seven H. pylori strains isolated from patients with various clinical statuses were used to characterize the C-ternimal polymorphic region of CagA. Our analysis showed that there is no correlation between the previously described CagA types and various disease outcomes in Indian context. Further analyses of different CagA structures revealed that the repeat units in the spacer sequences within the EPIYA motifs are actually more discrete than the previously proposed models of CagA variants. Conclusion Our analyses suggest that EPIYA motifs as well as the spacer sequence units are present as distinct insertions and deletions, which possibly have arisen from extensive recombination events. Moreover, we have identified several new CagA types, which could not be typed by the existing systems and therefore, we have proposed a new typing system. We hypothesize that a cagA gene encoding higher number EPIYA motifs may perhaps have arisen from cagA genes that encode lesser EPIYA motifs by acquisition of DNA segments through recombination events.

On the mixing time of geographical threshold graphs

Energy Technology Data Exchange (ETDEWEB)

Bradonjic, Milan [Los Alamos National Laboratory

2009-01-01

In this paper, we study the mixing time of random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). We specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).

Understanding the -C-X1-X2-C- motif in the active site of the thioredoxin superfamily: E. coli DsbA and its mutants as a model system.

Science.gov (United States)

Karshikoff, Andrey; Nilsson, Lennart; Foloppe, Nicolas

2013-08-27

E. coli DsbA is an intensively studied enzyme of the thioredoxin superfamily of thiol-disulfide oxidoreductases. DsbA catalyzes the disulfide bond formation and folding of proteins in the bacterial periplasm. DsbA and its mutants have highlighted the strong and puzzling influence of the -C-X1-X2-C- active site variants, found across the thioredoxin superfamily, on the ionization and redox properties of this site. However, the interpretation of these observations remains wanting, largely due to a dearth of structural information. Here, molecular dynamics simulations are used to provide extensive information on the structure and dynamics of reduced -C30-X31-X32-C33- motifs in wild type DsbA and 13 of its mutants. These simulations are combined with calculations of the pK of H32 and of the very low pK of the catalytic cysteine C30. In wild type DsbA, the titrations of C30 and H32 are shown to be coupled; the protonation states and dynamics of H32 are examined. The thiolate of C30 is stabilized by hydrogen bonds with the protein. Modulation of these hydrogen bonds by alteration of residue X32 has the greatest impact on the pK of C30, which rationalizes its higher pK in thioredoxin and tryparedoxin. Because of structural constrains, residue X31 has only an indirect and weak influence on the pK of C30. The dynamics of C30 is clearly related to its stabilizing interactions and pK value. Although relatively small differences between pKs were not reproduced in the calculations, the major trends are explained, adding new insights to our understanding of enzymes in this family.

Scaling up graph-based semisupervised learning via prototype vector machines.

Science.gov (United States)

Zhang, Kai; Lan, Liang; Kwok, James T; Vucetic, Slobodan; Parvin, Bahram

2015-03-01

When the amount of labeled data are limited, semisupervised learning can improve the learner's performance by also using the often easily available unlabeled data. In particular, a popular approach requires the learned function to be smooth on the underlying data manifold. By approximating this manifold as a weighted graph, such graph-based techniques can often achieve state-of-the-art performance. However, their high time and space complexities make them less attractive on large data sets. In this paper, we propose to scale up graph-based semisupervised learning using a set of sparse prototypes derived from the data. These prototypes serve as a small set of data representatives, which can be used to approximate the graph-based regularizer and to control model complexity. Consequently, both training and testing become much more efficient. Moreover, when the Gaussian kernel is used to define the graph affinity, a simple and principled method to select the prototypes can be obtained. Experiments on a number of real-world data sets demonstrate encouraging performance and scaling properties of the proposed approach. It also compares favorably with models learned via l1 -regularization at the same level of model sparsity. These results demonstrate the efficacy of the proposed approach in producing highly parsimonious and accurate models for semisupervised learning.

An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads

Directory of Open Access Journals (Sweden)

Nachiket Kapre

2011-01-01

synchronization to optimize our workloads for large networks up to 2025 parallel elements for BSP model and 25 parallel elements for Token Dataflow. This allows us to demonstrate speedups between 1.2× and 22× (3.5× mean, area reductions (number of Processing Elements between 3× and 15× (9× mean and dynamic energy savings between 2× and 3.5× (2.7× mean over a range of real-world graph applications in the BSP compute model. We deliver speedups of 0.5–13× (geomean 3.6× for Sparse Direct Matrix Solve (Token Dataflow compute model applied to a range of sparse matrices when using a high-quality placement algorithm. We expect such traffic optimization tools and techniques to become an essential part of the NoC application-mapping flow.

Insights into the motif preference of APOBEC3 enzymes.

Directory of Open Access Journals (Sweden)

Diako Ebrahimi

Full Text Available We used a multivariate data analysis approach to identify motifs associated with HIV hypermutation by different APOBEC3 enzymes. The analysis showed that APOBEC3G targets G mainly within GG, TG, TGG, GGG, TGGG and also GGGT. The G nucleotides flanked by a C at the 3' end (in +1 and +2 positions were indicated as disfavoured targets by APOBEC3G. The G nucleotides within GGGG were found to be targeted at a frequency much less than what is expected. We found that the infrequent G-to-A mutation within GGGG is not limited to the inaccessibility, to APOBEC3, of poly Gs in the central and 3'polypurine tracts (PPTs which remain double stranded during the HIV reverse transcription. GGGG motifs outside the PPTs were also disfavoured. The motifs GGAG and GAGG were also found to be disfavoured targets for APOBEC3. The motif-dependent mutation of G within the HIV genome by members of the APOBEC3 family other than APOBEC3G was limited to GA→AA changes. The results did not show evidence of other types of context dependent G-to-A changes in the HIV genome.

High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

Science.gov (United States)

Kempton, Mark

This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

Multiple graph regularized nonnegative matrix factorization

KAUST Repository

Wang, Jim Jing-Yan

2013-10-01

Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.

First-principles structures for the close-packed and the 7/2 motif of collagen

DEFF Research Database (Denmark)

Jalkanen, Karl J.; Olsen, Kasper; Knapp-Mohammady, Michaela

2012-01-01

The newly proposed close-packed motif for collagen and the more established 7/2 structure are investigated and compared. First-principles semi-empirical wave function theory and Kohn-Sham density functional theory are applied in the study of these relatively large and complex structures. The stru......The newly proposed close-packed motif for collagen and the more established 7/2 structure are investigated and compared. First-principles semi-empirical wave function theory and Kohn-Sham density functional theory are applied in the study of these relatively large and complex structures...

On square-free edge colorings of graphs

DEFF Research Database (Denmark)

Barat, Janos; Varju, P.P.

2008-01-01

An edge coloring of a graph is called square-free, if the sequence of colors on certain walks is not a square, that is not of the form x(1,)...,x(m), x(1),...,x(m), for any m epsilon N. Recently, various classes of walks have been suggested to be considered in the above definition. We construct...... graphs, for which the minimum number of colors needed for a square-free coloring is different if the considered set of walks vary, solving a problem posed by Bre ar and Klav2ar. We also prove the following: if an edge coloring of G is not square-free (even in the most general sense), then the length...

On θ-commutators and the corresponding non-commuting graphs

Directory of Open Access Journals (Sweden)

Shalchi S.

2017-12-01

Full Text Available The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other notions. Furthermore, we study independent sets in θ-non-commuting graphs, which enable us to evaluate the chromatic number of such graphs.

Multipodal Structure and Phase Transitions in Large Constrained Graphs

Science.gov (United States)

Kenyon, Richard; Radin, Charles; Ren, Kui; Sadun, Lorenzo

2017-07-01

We study the asymptotics of large, simple, labeled graphs constrained by the densities of two subgraphs. It was recently conjectured that for all feasible values of the densities most such graphs have a simple structure. Here we prove this in the special case where the densities are those of edges and of k-star subgraphs, k≥2 fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of vertices there is a partition of the vertices into M < ∞ subsets V_1, V_2, \\ldots , V_M, and a set of well-defined probabilities g_{ij} of an edge between any v_i \\in V_i and v_j \\in V_j. For 2≤ k≤ 30 we determine the phase space: the combinations of edge and k-star densities achievable asymptotically. For these models there are special points on the boundary of the phase space with nonunique asymptotic (graphon) structure; for the 2-star model we prove that the nonuniqueness extends to entropy maximizers in the interior of the phase space.

Developing a Translator from C Programs to Data Flow Graphs Using RAISE

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth

1996-01-01

Describes how a translator from a subset of C to data flow graphs has been formally developed using the RAISE (Rigorous Approach to Industrial Software Engineering) method and tools. In contrast to many development examples described in the literature, this development is not a case study......, but a real one, and it covers all development phases, including the code-generation phase. The translator is now one of the components of the LYCOS (LYngby CO-Synthesis) system, which is a software/hardware co-synthesis system under development at the Technical University of Denmark. The translator, together...... with the other components of LYCOS, provides a means for moving parts of C programs to dedicated hardware, thereby obtaining better performance. The translator was refined in steps, starting with an abstract specification and ending with a concrete specification from which C++ code was then automatically...

oPOSSUM: integrated tools for analysis of regulatory motif over-representation

Science.gov (United States)

Ho Sui, Shannan J.; Fulton, Debra L.; Arenillas, David J.; Kwon, Andrew T.; Wasserman, Wyeth W.

2007-01-01

The identification of over-represented transcription factor binding sites from sets of co-expressed genes provides insights into the mechanisms of regulation for diverse biological contexts. oPOSSUM, an internet-based system for such studies of regulation, has been improved and expanded in this new release. New features include a worm-specific version for investigating binding sites conserved between Caenorhabditis elegans and C. briggsae, as well as a yeast-specific version for the analysis of co-expressed sets of Saccharomyces cerevisiae genes. The human and mouse applications feature improvements in ortholog mapping, sequence alignments and the delineation of multiple alternative promoters. oPOSSUM2, introduced for the analysis of over-represented combinations of motifs in human and mouse genes, has been integrated with the original oPOSSUM system. Analysis using user-defined background gene sets is now supported. The transcription factor binding site models have been updated to include new profiles from the JASPAR database. oPOSSUM is available at http://www.cisreg.ca/oPOSSUM/ PMID:17576675

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

2017-06-01

Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

Crystal structures of tetramethylammonium (2,2′-bipyridinetetracyanidoferrate(III trihydrate and poly[[(2,2′-bipyridine-κ2N,N′di-μ2-cyanido-dicyanido(μ-ethylenediamine(ethylenediamine-κ2N,N′cadmium(IIiron(II] monohydrate

Directory of Open Access Journals (Sweden)

Songwuit Chanthee

2016-05-01

Full Text Available The crystal structures of the building block tetramethylammonium (2,2′-bipyridine-κ2N,N′tetracyanidoferrate(III trihydrate, [N(CH34][Fe(CN4(C10H8N2]·3H2O, (I, and a new two-dimensional cyanide-bridged bimetallic coordination polymer, poly[[(2,2′-bipyridine-κ2N,N′di-μ2-cyanido-dicyanido(μ-ethylenediamine-κ2N:N′(ethylenediamine-κ2N,N′cadmium(IIiron(II] monohydrate], [CdFe(CN4(C10H8N2(C2H8N22]·H2O, (II, are reported. In the crystal of (I, pairs of [Fe(2,2′-bipy(CN4]− units (2,2′-bipy is 2,2′-bipyridine are linked together through π–π stacking between the pyridyl rings of the 2,2′-bipy ligands to form a graphite-like structure parallel to the ab plane. The three independent water molecules are hydrogen-bonded alternately with each other, forming a ladder chain structure with R44(8 and R66(12 graph-set ring motifs, while the disordered [N(CH34]+ cations lie above and below the water chains, and the packing is stabilized by weak C—H...O hydrogen bonds. The water chains are further linked with adjacent sheets into a three-dimensional network via O—H...O hydrogen bonds involving the lattice water molecules and the N atoms of terminal cyanide groups of the [Fe(2,2′-bipy(CN4]− building blocks, forming an R44(12 ring motif. Compound (II features a two-dimensional {[Fe(2,2′-bipy(CN4Cd(en2]}n layer structure (en is ethylenediamine extending parallel to (010 and constructed from {[Fe(2,2′-bipy(CN4Cd(en]}n chains interlinked by bridging en ligands at the Cd atoms. Classical O—H...N and N—H...O hydrogen bonds involving the lattice water molecule and N atoms of terminal cyanide groups and the N—H groups of the en ligands are observed within the layers. The layers are further connected via π–π stacking interactions between adjacent pyridine rings of the 2,2′-bipy ligands, completing a three-dimensional supramolecular structure.

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

Science.gov (United States)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Groupies in multitype random graphs

OpenAIRE

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

C1-C2 instability with severe occipital headache in the setting of vertebral artery facet complex erosion.

Science.gov (United States)

Taher, Fadi; Bokums, Kristaps; Aichmair, Alexander; Hughes, Alexander P

2014-05-01

An exact understanding of patient vertebral artery anatomy is essential to safely place screws at the atlanto-axial level in posterior arthrodesis. We aim to report a case of erosion of the left vertebral artery into the C1-C2 facet complex with resultant rotatory and lateral listhesis presenting with severe occipital headache. This represents a novel etiology for this diagnosis and our report illustrates technical considerations when instrumenting the C1-C2 segment. We report a case of severe occipital headache due to C1-C2 instability with resultant left C2 nerve compression in the setting of erosion of the vertebral artery into the C1-C2 facet complex. A 68-year-old woman presented with a 12-month history of progressively debilitating headache and neck pain with atlanto-axial instability. Computed tomography (CT) angiography demonstrated erosion of the left vertebral artery into the left C1-C2 facet complex. In addition, the tortuous vertebral arteries had eroded into the C2 pedicles, eliminating the possibility for posterior pedicle screw placement. The patient underwent posterior arthrodesis of C1-C2 utilizing bilateral lateral mass fixation into C1 and bilateral trans-laminar fixation into C2 with resolution of all preoperative complaints. This study constitutes the first report of a tortuous vertebral artery causing the partial destruction of a C1-C2 facet complex, as well as instability, with the clinical presentation of severe occipital headache. It hereby presents a novel etiology for both the development of C1-C2 segment instability as well as the development of occipital headache. Careful evaluation of such lesions utilizing CT angiography is important when formulating a surgical plan.

Neighbor Rupture Degree of Some Middle Graphs

Directory of Open Access Journals (Sweden)

Gökşen BACAK-TURAN

2017-12-01

Full Text Available Networks have an important place in our daily lives. Internet networks, electricity networks, water networks, transportation networks, social networks and biological networks are some of the networks we run into every aspects of our lives. A network consists of centers connected by links. A network is represented when centers and connections modelled by vertices and edges, respectively. In consequence of the failure of some centers or connection lines, measurement of the resistance of the network until the communication interrupted is called vulnerability of the network. In this study, neighbor rupture degree which is a parameter that explores the vulnerability values of the resulting graphs due to the failure of some centers of a communication network and its neighboring centers becoming nonfunctional were applied to some middle graphs and neighbor rupture degree of the $M(C_{n},$ $M(P_{n},$ $M(K_{1,n},$ $M(W_{n},$ $M(P_{n}\\times K_{2}$ and $M(C_{n}\\times K_{2}$ have been found.

XML Graphs in Program Analysis

DEFF Research Database (Denmark)

Møller, Anders; Schwartzbach, Michael Ignatieff

2007-01-01

XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....

An unusual methylene aziridine refined in P2(1)/c and the nonstandard setting P2(1)/n.

Science.gov (United States)

Feast, George C; Haestier, James; Page, Lee W; Robertson, Jeremy; Thompson, Amber L; Watkin, David J

2009-12-01

The unusual methylene aziridine 6-tert-butyl-3-oxa-2-thia-1-azabicyclo[5.1.0]oct-6-ene 2,2-dioxide, C(9)H(15)NO(3)S, was found to crystallize with two molecules in the asymmetric unit. The structure was solved in both the approximately orthogonal and the oblique settings of space group No. 14, viz. P2(1)/n and P2(1)/c, respectively. A comparison of these results clearly displayed an increase in the correlation between coordinates in the ac plane for the oblique cell. The increase in the corresponding covariances makes a significant contribution to the standard uncertainties of derived parameters, e.g. bond lengths. Since there is yet no CIF definition for the full variance-covariance matrix, there are clear advantages to reporting the structure in the nonstandard space-group setting.

Discovery of a Regulatory Motif for Human Satellite DNA Transcription in Response to BATF2 Overexpression.

Science.gov (United States)

Bai, Xuejia; Huang, Wenqiu; Zhang, Chenguang; Niu, Jing; Ding, Wei

2016-03-01

One of the basic leucine zipper transcription factors, BATF2, has been found to suppress cancer growth and migration. However, little is known about the genes downstream of BATF2. HeLa cells were stably transfected with BATF2, then chromatin immunoprecipitation-sequencing was employed to identify the DNA motifs responsive to BATF2. Comprehensive bioinformatics analyses indicated that the most significant motif discovered as TTCCATT[CT]GATTCCATTC[AG]AT was primarily distributed among the chromosome centromere regions and mostly within human type II satellite DNA. Such motifs were able to prime the transcription of type II satellite DNA in a directional and asymmetrical manner. Consistently, satellite II transcription was up-regulated in BATF2-overexpressing cells. The present study provides insight into understanding the role of BATF2 in tumours and the importance of satellite DNA in the maintenance of genomic stability. Copyright© 2016 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.

The sharp bounds on general sum-connectivity index of four operations on graphs

Directory of Open Access Journals (Sweden)

Shehnaz Akhter

2016-09-01

Full Text Available Abstract The general sum-connectivity index χ α ( G $\\chi_{\\alpha}(G$ , for a (molecular graph G, is defined as the sum of the weights ( d G ( a 1 + d G ( a 2 α $(d_{G}(a_{1}+d_{G}(a_{2}^{\\alpha}$ of all a 1 a 2 ∈ E ( G $a_{1}a_{2}\\in E(G$ , where d G ( a 1 $d_{G}(a_{1}$ (or d G ( a 2 $d_{G}(a_{2}$ denotes the degree of a vertex a 1 $a_{1}$ (or a 2 $a_{2}$ in the graph G; E ( G $E(G$ denotes the set of edges of G, and α is an arbitrary real number. Eliasi and Taeri (Discrete Appl. Math. 157:794-803, 2009 introduced four new operations based on the graphs S ( G $S(G$ , R ( G $R(G$ , Q ( G $Q(G$ , and T ( G $T(G$ , and they also computed the Wiener index of these graph operations in terms of W ( F ( G $W(F(G$ and W ( H $W(H$ , where F is one of the symbols S, R, Q, T. The aim of this paper is to obtain sharp bounds on the general sum-connectivity index of the four operations on graphs.

Application of graph theory to the morphological analysis of settlements

OpenAIRE

Szmytkie Robert

2017-01-01

In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement). When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the n...

Redetermined structure of gossypol (P3 polymorph

Directory of Open Access Journals (Sweden)

Muhabbat Honkeldieva

2015-07-01

Full Text Available An improved crystal structure of the title compound, C30H30O8 (systematic name: 1,1′,6,6′,7,7′-hexahydroxy-5,5′-diisopropyl-3,3′-dimethyl[2,2′-binaphthalene]-8,8′-dicarbaldehyde, was determined based on modern CCD data. Compared to the previous structure [Talipov et al. (1985. Khim. Prirod. Soedin. (Chem. Nat. Prod., 6, 20–24], geometrical precision has been improved (typical C—C bond-distance s.u. = 0.002 Å in the present structure compared to 0.005 Å in the previous structure and the locations of several H atoms have been corrected. The gossypol molecules are in the aldehyde tautomeric form and the dihedral angle between the naphthyl fragments is 80.42 (4°. Four intramolecular O—H...O hydrogen bonds are formed. In the crystal, inversion dimers with graph-set motif R22(20 are formed by pairs of O—H...O hydrogen bonds; another pair of O—H...O hydrogen bonds with the same graph-set motif links the dimers into [001] chains. The packing of such chains in the crystal leads to the formation of channels (diameter = 5–8 Å propagating in the [101] direction. The channels presumably contain highly disordered solvent molecules; their contribution to the scattering was removed with the SQUEEZE [Spek (2015. Acta Cryst. C71, 9–18] routine in PLATON and the stated molecular mass, density etc., do not take them into account.

A Feynman graph selection tool in GRACE system

International Nuclear Information System (INIS)

Yuasa, Fukuko; Ishikawa, Tadashi; Kaneko, Toshiaki

2001-01-01

We present a Feynman graph selection tool grcsel, which is an interpreter written in C language. In the framework of GRACE, it enables us to get a subset of Feynman graphs according to given conditions

1,3,4-Tri-O-acetyl-2-N-(trifluoroacetyl-β-l-fucose

Directory of Open Access Journals (Sweden)

David C. McCutcheon

2014-02-01

Full Text Available The title compound, C14H18F3NO8, was produced through conjugation of 1,3,4-tri-O-acetyl-2-azidodeoxy-α,β-l-fucose with trifluoroacetyl chloride in the presence of bis(diphenylphosphinoethane in tetrahydrofuran at room temperature. The X-ray crystal structure reveals that the β-anomer of the product mixture crystallizes from ethyl acetate/hexanes. The compound exists in a typical chair conformation with the maximum possible number of substituents, four out of five, located in the sterically preferred equatorial positions. The major directional force facilitating packing of the molecules are N—H...O hydrogen bonds involving the amide moieties of neighboring molecules, which connect molecules stacked along the a-axis direction into infinite strands with a C11(4 graph-set motif. Formation of the strands is assisted by a number of weaker C—H...O interactions involving the methine and methyl H atoms. These strands are connected through further C—H...O and C—H...F interactions into a three dimensional network

UKIRAN KERAWANG ACEH GAYO SEBAGAI INSPIRASI PENCIPTAAN MOTIF BATIK KHAS GAYO

Directory of Open Access Journals (Sweden)

Irfa ina Rohana Salma

2016-12-01

Full Text Available ABSTRAK Industri batik mulai berkembang di Gayo, tetapi belum memiliki motif batik khas daerah. Oleh karena itu perlu diciptakan motif batik khas Gayo, dengan mengambil inspirasi dari ukiran yang terdapat pada rumah tradisional yang biasa disebut ukiran kerawang Gayo. Tujuan penciptaan seni ini adalah untuk menciptakan motif batik yang memiliki ciri khas Gayo. Metode yang digunakan yaitu eksplorasi ide, perancangan, dan perwujudan menjadi motif batik. Dalam kegiatan ini telah diciptakan enam motif batik khas Gayo yaitu: (1 Motif Ceplok Gayo; (2 Motif Gayo Tegak; (3 Motif Gayo Lurus; (4 Motif Parang Gayo; (5 Motif Gayo Lembut; dan (6 Motif Geometris Gayo. Hasil uji kesukaan terhadap motif kepada lima puluh responden menunjukkan bahwa Motif Ceplok Gayo paling banyak dipilih oleh responden yaitu sebesar 19%, sedangkan Motif Parang Gayo 18%, Motif Gayo Lembut 17%, Motif Geometris Gayo 17%, Motif Gayo Lurus 15% dan Motif Gayo Tegak 14%. Rata-rata motif yang dihasilkan mendapatkan apresiasi yang baik dari responden, sehingga semua motif layak diproduksi sebagai batik khas Gayo.Kata kunci: batik Gayo, Motif Ceplok Gayo, Motif Parang Gayo.ABSTRACTBatik industry began to develop in Gayo, but have not had a typical batik motif itself. Therefore, it is necessary to create batik motifs of Gayo, by taking inspiration from the carvings found in traditional houses commonly called kerawang Gayo. The purpose of this art is to create motifs those have a Gayo characteristic. The method used are the idea exploration, design, and motifs embodiment. In this activity has created six Gayo batik motifs, namely: (1 Motif Ceplok Gayo; (2 Motif Gayo Tegak; (3 Motif GayoLurus; (4 Motif Parang Gayo; (5 Motif Gayo Lembut; dan (6 Motif Geometris Gayo. The test results fondness of the motives to fifty respondents indicated that the Motif Ceplok Gayo most preferred by respondents ie 19%, while Motif Parang Gayo 18%, Motif Gayo Lembut 17%, Motif Geometris Gayo 17%, Motif Gayo

Organofluorine chemistry: synthesis and conformation of vicinal fluoromethylene motifs.

Science.gov (United States)

O'Hagan, David

2012-04-20

The C-F bond is the most polar bond in organic chemistry, and thus the bond has a relatively large dipole moment with a significant -ve charge density on the fluorine atom and correspondingly a +ve charge density on carbon. The electrostatic nature of the bond renders it the strongest one in organic chemistry. However, the fluorine atom itself is nonpolarizable, and thus, despite the charge localization on fluorine, it is a poor hydrogen-bonding acceptor. These properties of the C-F bond make it attractive in the design of nonviscous but polar organic compounds, with a polarity limited to influencing the intramolecular nature of the molecule and less so intermolecular interactions with the immediate environment. In this Perspective, the synthesis of aliphatic chains carrying multivicinal fluoromethylene motifs is described. It emerges that the dipoles of adjacent C-F bonds orientate relative to each other, and thus, individual diastereoisomers display different backbone carbon chain conformations. These conformational preferences recognize the influence of the well-known gauche effect associated with 1,2-difluoroethane but extend to considering 1,3-fluorine-fluorine dipolar repulsions. The synthesis of carbon chains carrying two, three, four, five, and six vicinal fluoromethylene motifs is described, with an emphasis on our own research contributions. These motifs obey almost predictable conformational behavior, and they emerge as candidates for inclusion in the design of performance organic molecules. © 2012 American Chemical Society

A survey of motif finding Web tools for detecting binding site motifs in ChIP-Seq data.

Science.gov (United States)

Tran, Ngoc Tam L; Huang, Chun-Hsi

2014-02-20

ChIP-Seq (chromatin immunoprecipitation sequencing) has provided the advantage for finding motifs as ChIP-Seq experiments narrow down the motif finding to binding site locations. Recent motif finding tools facilitate the motif detection by providing user-friendly Web interface. In this work, we reviewed nine motif finding Web tools that are capable for detecting binding site motifs in ChIP-Seq data. We showed each motif finding Web tool has its own advantages for detecting motifs that other tools may not discover. We recommended the users to use multiple motif finding Web tools that implement different algorithms for obtaining significant motifs, overlapping resemble motifs, and non-overlapping motifs. Finally, we provided our suggestions for future development of motif finding Web tool that better assists researchers for finding motifs in ChIP-Seq data.

Argo_CUDA: Exhaustive GPU based approach for motif discovery in large DNA datasets.

Science.gov (United States)

Vishnevsky, Oleg V; Bocharnikov, Andrey V; Kolchanov, Nikolay A

2018-02-01

The development of chromatin immunoprecipitation sequencing (ChIP-seq) technology has revolutionized the genetic analysis of the basic mechanisms underlying transcription regulation and led to accumulation of information about a huge amount of DNA sequences. There are a lot of web services which are currently available for de novo motif discovery in datasets containing information about DNA/protein binding. An enormous motif diversity makes their finding challenging. In order to avoid the difficulties, researchers use different stochastic approaches. Unfortunately, the efficiency of the motif discovery programs dramatically declines with the query set size increase. This leads to the fact that only a fraction of top "peak" ChIP-Seq segments can be analyzed or the area of analysis should be narrowed. Thus, the motif discovery in massive datasets remains a challenging issue. Argo_Compute Unified Device Architecture (CUDA) web service is designed to process the massive DNA data. It is a program for the detection of degenerate oligonucleotide motifs of fixed length written in 15-letter IUPAC code. Argo_CUDA is a full-exhaustive approach based on the high-performance GPU technologies. Compared with the existing motif discovery web services, Argo_CUDA shows good prediction quality on simulated sets. The analysis of ChIP-Seq sequences revealed the motifs which correspond to known transcription factor binding sites.

Groupies in multitype random graphs.

Science.gov (United States)

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

Science.gov (United States)

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Geodetic achievement and avoidance games for graphs | Haynes ...

African Journals Online (AJOL)

Let G = (V,E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of S is the set of all vertices on geodesics (shortest paths) between two vertices of S. We study the geodetic achievement and avoidance games defined by Buckley and Harary (Geodetic games for graphs, Quaestiones Math.

Ni2+-binding RNA motifs with an asymmetric purine-rich internal loop and a G-A base pair.

Science.gov (United States)

Hofmann, H P; Limmer, S; Hornung, V; Sprinzl, M

1997-01-01

RNA molecules with high affinity for immobilized Ni2+ were isolated from an RNA pool with 50 randomized positions by in vitro selection-amplification. The selected RNAs preferentially bind Ni2+ and Co2+ over other cations from first series transition metals. Conserved structure motifs, comprising about 15 nt, were identified that are likely to represent the Ni2+ binding sites. Two conserved motifs contain an asymmetric purine-rich internal loop and probably a mismatch G-A base pair. The structure of one of these motifs was studied with proton NMR spectroscopy and formation of the G-A pair at the junction of helix and internal loop was demonstrated. Using Ni2+ as a paramagnetic probe, a divalent metal ion binding site near this G-A base pair was identified. Ni2+ ions bound to this motif exert a specific stabilization effect. We propose that small asymmetric purine-rich loops that contain a G-A interaction may represent a divalent metal ion binding site in RNA. PMID:9409620

Chromatic graph theory

CERN Document Server

Chartrand, Gary; Rosen, Kenneth H

2008-01-01

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

The depression of a graph and k-kernels

Directory of Open Access Journals (Sweden)

Schurch Mark

2014-05-01

Full Text Available An edge ordering of a graph G is an injection f : E(G → R, the set of real numbers. A path in G for which the edge ordering f increases along its edge sequence is called an f-ascent ; an f-ascent is maximal if it is not contained in a longer f-ascent. The depression of G is the smallest integer k such that any edge ordering f has a maximal f-ascent of length at most k. A k-kernel of a graph G is a set of vertices U ⊆ V (G such that for any edge ordering f of G there exists a maximal f-ascent of length at most k which neither starts nor ends in U. Identifying a k-kernel of a graph G enables one to construct an infinite family of graphs from G which have depression at most k. We discuss various results related to the concept of k-kernels, including an improved upper bound for the depression of trees.

A first course in graph theory and combinatorics

CERN Document Server

Cioabă, Sebastian M

2009-01-01

The concept of a graph is fundamental in mathematics since it conveniently encodes diverse relations and facilitates combinatorial analysis of many complicated counting problems. In this book, the authors have traced the origins of graph theory from its humble beginnings of recreational mathematics to its modern setting for modeling communication networks as is evidenced by the World Wide Web graph used by many Internet search engines. This book is an introduction to graph theory and combinatorial analysis. It is based on courses given by the second author at Queen's University at Kingston, Ontario, Canada between 2002 and 2008. The courses were aimed at students in their final year of their undergraduate program.

Regulation of synaptic inhibition by phospho-dependent binding of the AP2 complex to a YECL motif in the GABAA receptor γ2 subunit

Science.gov (United States)

Kittler, Josef T.; Chen, Guojun; Kukhtina, Viktoria; Vahedi-Faridi, Ardeschir; Gu, Zhenglin; Tretter, Verena; Smith, Katharine R.; McAinsh, Kristina; Arancibia-Carcamo, I. Lorena; Saenger, Wolfram; Haucke, Volker; Yan, Zhen; Moss, Stephen J.

2008-01-01

The regulation of the number of γ2-subunit-containing GABAA receptors (GABAARs) present at synapses is critical for correct synaptic inhibition and animal behavior. This regulation occurs, in part, by the controlled removal of receptors from the membrane in clathrin-coated vesicles, but it remains unclear how clathrin recruitment to surface γ2-subunit-containing GABAARs is regulated. Here, we identify a γ2-subunit-specific Yxxφ-type-binding motif for the clathrin adaptor protein, AP2, which is located within a site for γ2-subunit tyrosine phosphorylation. Blocking GABAAR-AP2 interactions via this motif increases synaptic responses within minutes. Crystallographic and biochemical studies reveal that phosphorylation of the Yxxφ motif inhibits AP2 binding, leading to increased surface receptor number. In addition, the crystal structure provides an explanation for the high affinity of this motif for AP2 and suggests that γ2-subunit-containing heteromeric GABAARs may be internalized as dimers or multimers. These data define a mechanism for tyrosine kinase regulation of GABAAR surface levels and synaptic inhibition. PMID:18305175

A systems wide mass spectrometric based linear motif screen to identify dominant in-vivo interacting proteins for the ubiquitin ligase MDM2.

Science.gov (United States)

Nicholson, Judith; Scherl, Alex; Way, Luke; Blackburn, Elizabeth A; Walkinshaw, Malcolm D; Ball, Kathryn L; Hupp, Ted R

2014-06-01

Linear motifs mediate protein-protein interactions (PPI) that allow expansion of a target protein interactome at a systems level. This study uses a proteomics approach and linear motif sub-stratifications to expand on PPIs of MDM2. MDM2 is a multi-functional protein with over one hundred known binding partners not stratified by hierarchy or function. A new linear motif based on a MDM2 interaction consensus is used to select novel MDM2 interactors based on Nutlin-3 responsiveness in a cell-based proteomics screen. MDM2 binds a subset of peptide motifs corresponding to real proteins with a range of allosteric responses to MDM2 ligands. We validate cyclophilin B as a novel protein with a consensus MDM2 binding motif that is stabilised by Nutlin-3 in vivo, thus identifying one of the few known interactors of MDM2 that is stabilised by Nutlin-3. These data invoke two modes of peptide binding at the MDM2 N-terminus that rely on a consensus core motif to control the equilibrium between MDM2 binding proteins. This approach stratifies MDM2 interacting proteins based on the linear motif feature and provides a new biomarker assay to define clinically relevant Nutlin-3 responsive MDM2 interactors. Copyright © 2014 Elsevier Inc. All rights reserved.

Chemokine (C-C motif) receptor 5-using envelopes predominate in dual/mixed-tropic HIV from the plasma of drug-naive individuals.

Science.gov (United States)

Irlbeck, David M; Amrine-Madsen, Heather; Kitrinos, Kathryn M; Labranche, Celia C; Demarest, James F

2008-07-31

HIV-1 utilizes CD4 and either chemokine (C-C motif) receptor 5 (CCR5) or chemokine (C-X-C motif) receptor 4 (CXCR4) to gain entry into host cells. Small molecule CCR5 antagonists are currently being developed for the treatment of HIV-1 infection. Because HIV-1 may also use CXCR4 for entry, the use of CCR5 entry inhibitors is controversial for patients harboring CCR5-using and CXCR4-using (dual/mixed-tropic) viruses. The goal of the present study was to determine the proportion of CCR5-tropic and CXCR4-tropic viruses in dual/mixed-tropic virus isolates from drug-naïve patients and the phenotypic and genotypic relationships of viruses that use CCR5 or CXCR4 or both. Fourteen antiretroviral-naive HIV-1-infected patients were identified as having population coreceptor tropism readout of dual/mixed-tropic viruses. Intrapatient comparisons of coreceptor tropism and genotype of env clones were conducted on plasma virus from each patient. Population HIV-1 envelope tropism and susceptibility to the CCR5 entry inhibitor, aplaviroc, were performed using the Monogram Biosciences Trofile Assay. Twelve env clones from each patient were analyzed for coreceptor tropism, aplaviroc sensitivity, genotype, and intrapatient phylogenetic relationships. Viral populations from antiretroviral-naive patients with dual/mixed-tropic virus are composed primarily of CCR5-tropic env clones mixed with those that use both coreceptors (R5X4-tropic) and, occasionally, CXCR4-tropic env clones. Interestingly, the efficiency of CXCR4 use by R5X4-tropic env clones varied with their genetic relationships to CCR5-tropic env clones from the same patient. These data show that the majority of viruses in these dual/mixed-tropic populations use CCR5 and suggest that antiretroviral-naive patients may benefit from combination therapy that includes CCR5 entry inhibitors.

Discovering Motifs in Biological Sequences Using the Micron Automata Processor.

Science.gov (United States)

Roy, Indranil; Aluru, Srinivas

2016-01-01

Finding approximately conserved sequences, called motifs, across multiple DNA or protein sequences is an important problem in computational biology. In this paper, we consider the (l, d) motif search problem of identifying one or more motifs of length l present in at least q of the n given sequences, with each occurrence differing from the motif in at most d substitutions. The problem is known to be NP-complete, and the largest solved instance reported to date is (26,11). We propose a novel algorithm for the (l,d) motif search problem using streaming execution over a large set of non-deterministic finite automata (NFA). This solution is designed to take advantage of the micron automata processor, a new technology close to deployment that can simultaneously execute multiple NFA in parallel. We demonstrate the capability for solving much larger instances of the (l, d) motif search problem using the resources available within a single automata processor board, by estimating run-times for problem instances (39,18) and (40,17). The paper serves as a useful guide to solving problems using this new accelerator technology.

Factors Affecting the Binding of a Recombinant Heavy Metal-Binding Domain (CXXC motif Protein to Heavy Metals

Directory of Open Access Journals (Sweden)

Kamala Boonyodying

2012-06-01

Full Text Available A number of heavy metal-binding proteins have been used to study bioremediation. CXXC motif, a metal binding domain containing Cys-X-X-Cys motif, has been identified in various organisms. These proteins are capable of binding various types of heavy metals. In this study, heavy metal binding domain (CXXC motif recombinant protein encoded from mcsA gene of S. aureus were cloned and overexpressed in Escherichia coli. The factors involved in the metal-binding activity were determined in order to analyze the potential of recombinant protein for bioremediation. A recombinant protein can be bound to Cd2+, Co2+, Cu2+ and Zn2+. The thermal stability of a recombinant protein was tested, and the results showed that the metal binding activity to Cu2+ and Zn2+ still exist after treating the protein at 85ºC for 30 min. The temperature and pH that affected the metal binding activity was tested and the results showed that recombinant protein was still bound to Cu2+ at 65ºC, whereas a pH of 3-7 did not affect the metal binding E. coli harboring a pRset with a heavy metal-binding domain CXXC motif increased the resistance of heavy metals against CuCl2 and CdCl2. This study shows that metal binding domain (CXXC motif recombinant protein can be effectively bound to various types of heavy metals and may be used as a potential tool for studying bioremediation.

Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format.

Directory of Open Access Journals (Sweden)

David ePeebles

2015-10-01

Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.

Stem/Progenitor Cell Proteoglycans Decorated with 7-D-4, 4-C-3 and 3-B-3(-) Chondroitin Sulphate Motifs Are Morphogenetic Markers Of Tissue Development.

Science.gov (United States)

Hayes, Anthony J; Smith, Susan M; Caterson, Bruce; Melrose, James

2018-06-11

This study reviewed the occurrence of chondroitin sulphate (CS) motifs 4-C-3, 7-D-4 and 3-B-3(-) which are expressed by progenitor cells in tissues undergoing morphogenesis. These motifs have a transient early expression pattern during tissue development and also appear in mature tissues during pathological remodeling and attempted repair processes by activated adult stem cells. The CS motifs are information and recognition modules, which may regulate cellular behavior and delineate stem cell niches in developmental tissues. One of the difficulties in determining the precise role of stem cells in tissue development and repair processes is their short engraftment period and the lack of specific markers, which differentiate the activated stem cell lineages from the resident cells. The CS sulphation motifs 7-D-4, 4-C-3 and 3-B-3 (-) decorate cell surface proteoglycans on activated stem/progenitor cells and appear to identify these cells in transitional areas of tissue development and in tissue repair and may be applicable to determining a more precise role for stem cells in tissue morphogenesis. This article is protected by copyright. All rights reserved. © 2018 AlphaMed Press.

Coloring and The Lonely Graph

OpenAIRE

Rabern, Landon

2007-01-01

We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...

Relative substituent orientation in the structure of cis-3-chloro-1,3-dimethyl-N-(4-nitrophenyl-2-oxocyclopentane-1-carboxamide

Directory of Open Access Journals (Sweden)

Matthias Zeller

2014-09-01

Full Text Available The structure of the title compound, C14H15ClN2O4, prepared by reaction of a methacryloyl dimer with nitroaniline, was determined to establish the relative substituent orientation on the cyclopentanone ring. In agreement with an earlier proposed reaction mechanism, the amide group and the methyl group adjacent to the chloro substituent adopt equatorial positions and relative cis orientation, whereas the Cl substituent itself and the methyl group adjacent to the amide have axial orientations relative to the mean plane of the five-membered ring. The conformation of the molecule is stabilized by one classical N—H...O (2.18 Å and one non-classical C—H...O (2.23 Å hydrogen bond, each possessing an S(6 graph-set motif. The crystal packing is defined by several non-classical intramolecular hydrogen bonds, as well as by partial stacking of the aromatic rings.

Refining intra-protein contact prediction by graph analysis

Directory of Open Access Journals (Sweden)

Eyal Eran

2007-05-01

Full Text Available Abstract Background Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific contacts can be further refined by jointly analyzing predicted contacts, and by adding information on the relative positions of contacts in the protein primary sequence. Results We introduce a method for graph analysis refinement of intra-protein contacts, termed GARP. Our previously presented intra-contact prediction method by means of pair-to-pair substitution matrix (P2PConPred was used to test the GARP method. In our approach, the top contact predictions obtained by a basic prediction method were used as edges to create a weighted graph. The edges were scored by a mutual clustering coefficient that identifies highly connected graph regions, and by the density of edges between the sequence regions of the edge nodes. A test set of 57 proteins with known structures was used to determine contacts. GARP improves the accuracy of the P2PConPred basic prediction method in whole proteins from 12% to 18%. Conclusion Using a simple approach we increased the contact prediction accuracy of a basic method by 1.5 times. Our graph approach is simple to implement, can be used with various basic prediction methods, and can provide input for further downstream analyses.

An efficient identification strategy of clonal tea cultivars using long-core motif SSR markers.

Science.gov (United States)

Wang, Rang Jian; Gao, Xiang Feng; Kong, Xiang Rui; Yang, Jun

2016-01-01

Microsatellites, or simple sequence repeats (SSRs), especially those with long-core motifs (tri-, tetra-, penta-, and hexa-nucleotide) represent an excellent tool for DNA fingerprinting. SSRs with long-core motifs are preferred since neighbor alleles are more easily separated and identified from each other, which render the interpretation of electropherograms and the true alleles more reliable. In the present work, with the purpose of characterizing a set of core SSR markers with long-core motifs for well fingerprinting clonal cultivars of tea (Camellia sinensis), we analyzed 66 elite clonal tea cultivars in China with 33 initially-chosen long-core motif SSR markers covering all the 15 linkage groups of tea plant genome. A set of 6 SSR markers were conclusively selected as core SSR markers after further selection. The polymorphic information content (PIC) of the core SSR markers was >0.5, with ≤5 alleles in each marker containing 10 or fewer genotypes. Phylogenetic analysis revealed that the core SSR markers were not strongly correlated with the trait 'cultivar processing-property'. The combined probability of identity (PID) between two random cultivars for the whole set of 6 SSR markers was estimated to be 2.22 × 10(-5), which was quite low, confirmed the usefulness of the proposed SSR markers for fingerprinting analyses in Camellia sinensis. Moreover, for the sake of quickly discriminating the clonal tea cultivars, a cultivar identification diagram (CID) was subsequently established using these core markers, which fully reflected the identification process and provided the immediate information about which SSR markers were needed to identify a cultivar chosen among the tested ones. The results suggested that long-core motif SSR markers used in the investigation contributed to the accurate and efficient identification of the clonal tea cultivars and enabled the protection of intellectual property.

Test bank for precalculus functions & graphs

CERN Document Server

Kolman, Bernard; Levitan, Michael L

1984-01-01

Test Bank for Precalculus: Functions & Graphs is a supplementary material for the text, Precalculus: Functions & Graphs. The book is intended for use by mathematics teachers.The book contains standard tests for each chapter in the textbook. Each set of test focuses on gauging the level of knowledge the student has achieved during the course. The answers for each chapter test and the final exam are found at the end of the book.Mathematics teachers teaching calculus will find the book extremely useful.

Memetic algorithms for de novo motif-finding in biomedical sequences.

Science.gov (United States)

Bi, Chengpeng

2012-09-01

The objectives of this study are to design and implement a new memetic algorithm for de novo motif discovery, which is then applied to detect important signals hidden in various biomedical molecular sequences. In this paper, memetic algorithms are developed and tested in de novo motif-finding problems. Several strategies in the algorithm design are employed that are to not only efficiently explore the multiple sequence local alignment space, but also effectively uncover the molecular signals. As a result, there are a number of key features in the implementation of the memetic motif-finding algorithm (MaMotif), including a chromosome replacement operator, a chromosome alteration-aware local search operator, a truncated local search strategy, and a stochastic operation of local search imposed on individual learning. To test the new algorithm, we compare MaMotif with a few of other similar algorithms using simulated and experimental data including genomic DNA, primary microRNA sequences (let-7 family), and transmembrane protein sequences. The new memetic motif-finding algorithm is successfully implemented in C++, and exhaustively tested with various simulated and real biological sequences. In the simulation, it shows that MaMotif is the most time-efficient algorithm compared with others, that is, it runs 2 times faster than the expectation maximization (EM) method and 16 times faster than the genetic algorithm-based EM hybrid. In both simulated and experimental testing, results show that the new algorithm is compared favorably or superior to other algorithms. Notably, MaMotif is able to successfully discover the transcription factors' binding sites in the chromatin immunoprecipitation followed by massively parallel sequencing (ChIP-Seq) data, correctly uncover the RNA splicing signals in gene expression, and precisely find the highly conserved helix motif in the transmembrane protein sequences, as well as rightly detect the palindromic segments in the primary micro