Almost all k-cop-win graphs contain a dominating set of cardinality k

OpenAIRE

Pralat, Pawel

2013-01-01

We consider $k$-cop-win graphs in the binomial random graph $G(n,1/2).$ It is known that almost all cop-win graphs contain a universal vertex. We generalize this result and prove that for every $k \\in N$, almost all $k$-cop-win graphs contain a dominating set of cardinality $k$. From this it follows that the asymptotic number of labelled $k$-cop-win graphs of order $n$ is equal to $(1+o(1)) (1-2^{-k})^{-k} {n \\choose k} 2^{n^2/2 - (1/2-\\log_2(1-2^{-k})) n}$.

A Nuclear Ribosomal DNA Phylogeny of Acer Inferred with Maximum Likelihood, Splits Graphs, and Motif Analysis of 606 Sequences

Directory of Open Access Journals (Sweden)

Guido W. Grimm

2006-01-01

Full Text Available The multi-copy internal transcribed spacer (ITS region of nuclear ribosomal DNA is widely used to infer phylogenetic relationships among closely related taxa. Here we use maximum likelihood (ML and splits graph analyses to extract phylogenetic information from ~ 600 mostly cloned ITS sequences, representing 81 species and subspecies of Acer, and both species of its sister Dipteronia. Additional analyses compared sequence motifs in Acer and several hundred Anacardiaceae, Burseraceae, Meliaceae, Rutaceae, and Sapindaceae ITS sequences in GenBank. We also assessed the effects of using smaller data sets of consensus sequences with ambiguity coding (accounting for within-species variation instead of the full (partly redundant original sequences. Neighbor-nets and bipartition networks were used to visualize conflict among character state patterns. Species clusters observed in the trees and networks largely agree with morphology-based classifications; of de Jong’s (1994 16 sections, nine are supported in neighbor-net and bipartition networks, and ten by sequence motifs and the ML tree; of his 19 series, 14 are supported in networks, motifs, and the ML tree. Most nodes had higher bootstrap support with matrices of 105 or 40 consensus sequences than with the original matrix. Within-taxon ITS divergence did not differ between diploid and polyploid Acer, and there was little evidence of differentiated parental ITS haplotypes, suggesting that concerted evolution in Acer acts rapidly.

A Nuclear Ribosomal DNA Phylogeny of Acer Inferred with Maximum Likelihood, Splits Graphs, and Motif Analysis of 606 Sequences

Science.gov (United States)

Grimm, Guido W.; Renner, Susanne S.; Stamatakis, Alexandros; Hemleben, Vera

2007-01-01

The multi-copy internal transcribed spacer (ITS) region of nuclear ribosomal DNA is widely used to infer phylogenetic relationships among closely related taxa. Here we use maximum likelihood (ML) and splits graph analyses to extract phylogenetic information from ~ 600 mostly cloned ITS sequences, representing 81 species and subspecies of Acer, and both species of its sister Dipteronia. Additional analyses compared sequence motifs in Acer and several hundred Anacardiaceae, Burseraceae, Meliaceae, Rutaceae, and Sapindaceae ITS sequences in GenBank. We also assessed the effects of using smaller data sets of consensus sequences with ambiguity coding (accounting for within-species variation) instead of the full (partly redundant) original sequences. Neighbor-nets and bipartition networks were used to visualize conflict among character state patterns. Species clusters observed in the trees and networks largely agree with morphology-based classifications; of de Jong’s (1994) 16 sections, nine are supported in neighbor-net and bipartition networks, and ten by sequence motifs and the ML tree; of his 19 series, 14 are supported in networks, motifs, and the ML tree. Most nodes had higher bootstrap support with matrices of 105 or 40 consensus sequences than with the original matrix. Within-taxon ITS divergence did not differ between diploid and polyploid Acer, and there was little evidence of differentiated parental ITS haplotypes, suggesting that concerted evolution in Acer acts rapidly. PMID:19455198

Motif decomposition of the phosphotyrosine proteome reveals a new N-terminal binding motif for SHIP2

DEFF Research Database (Denmark)

Miller, Martin Lee; Hanke, S.; Hinsby, A. M.

2008-01-01

set of 481 unique phosphotyrosine (Tyr(P)) peptides by sequence similarity to known ligands of the Src homology 2 (SH2) and the phosphotyrosine binding (PTB) domains. From 20 clusters we extracted 16 known and four new interaction motifs. Using quantitative mass spectrometry we pulled down Tyr......(P)-specific binding partners for peptides corresponding to the extracted motifs. We confirmed numerous previously known interaction motifs and found 15 new interactions mediated by phosphosites not previously known to bind SH2 or PTB. Remarkably, a novel hydrophobic N-terminal motif ((L/V/I)(L/V/I)pY) was identified...

The number of independent sets in unicyclic graphs

DEFF Research Database (Denmark)

Pedersen, Anders Sune; Vestergaard, Preben Dahl

  In this paper, we determine upper and lower bounds for the number of independent sets in a unicyclic graph in terms of its order. This gives an upper bound for the number of independent sets in a connected graph which contains at least one cycle. We also determine the upper bound for the number...

Partitioning the vertices of a graph into two total dominating sets ...

African Journals Online (AJOL)

A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study graphs whose vertex set can be partitioned into two total dominating sets. In particular, we develop several sufficient conditions for a graph to have a vertex partition into two total dominating sets.

On The Center Sets and Center Numbers of Some Graph Classes

OpenAIRE

R, Ram Kumar.; Balakrishnan, Kannan; Changat, Manoj; Sreekumar, A.; Narasimha-Shenoi, Prasanth G.

2013-01-01

For a set $S$ of vertices and the vertex $v$ in a connected graph $G$, $\\displaystyle\\max_{x \\in S}d(x,v)$ is called the $S$-eccentricity of $v$ in $G$. The set of vertices with minimum $S$-eccentricity is called the $S$-center of $G$. Any set $A$ of vertices of $G$ such that $A$ is an $S$-center for some set $S$ of vertices of $G$ is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, $K_{m,n}$, $K_n-e$, wheel graphs, odd cycles and symmetric e...

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....

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].

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.

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...

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.

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.)

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

The R{sup ∗}-operation for Feynman graphs with generic numerators

Energy Technology Data Exchange (ETDEWEB)

Herzog, Franz [Nikhef Theory Group,Science Park 105, 1098 XG Amsterdam (Netherlands); Ruijl, Ben [Nikhef Theory Group,Science Park 105, 1098 XG Amsterdam (Netherlands); Leiden University,Niels Bohrweg 1, 2333 CA Leiden (Netherlands)

2017-05-08

The R{sup ∗}-operation by Chetyrkin, Tkachov, and Smirnov is a generalisation of the BPHZ R-operation, which subtracts both ultraviolet and infrared divergences of euclidean Feynman graphs with non-exceptional external momenta. It can be used to compute the divergent parts of such Feynman graphs from products of simpler Feynman graphs of lower loops. In this paper we extend the R{sup ∗}-operation to Feynman graphs with arbitrary numerators, including tensors. We also provide a novel way of defining infrared counterterms which closely resembles the definition of its ultraviolet counterpart. We further express both infrared and ultraviolet counterterms in terms of scaleless vacuum graphs with a logarithmic degree of divergence. By exploiting symmetries, integrand and integral relations, which the counterterms of scaleless vacuum graphs satisfy, we can vastly reduce their number and complexity. A FORM implementation of this method was used to compute the five loop beta function in QCD for a general gauge group. To illustrate the procedure, we compute the poles in the dimensional regulator of all top-level propagator graphs at five loops in four dimensional ϕ{sup 3} theory.

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.

On the r-dynamic chromatic number of the corronation by complete graph

Science.gov (United States)

Indah Kristiana, Arika; Imam Utoyo, M.; Dafik

2018-04-01

In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors. The r-dynamic chromatic number, χ r (G) is the minimum k such that graph G has an r-dynamic k-coloring. We will obtain lower bound of the r-dynamic chromatic number of {χ }r({K}nȯ H), and {χ }r(Hȯ {K}m) We also study the exact value of the r-dynamic chromatic number of {χ }r({K}nȯ {S}m),{χ }r({K}nȯ {F}m),{χ }r({S}nȯ {K}m),{χ }r({F}nȯ {K}m) and {χ }r({K}nȯ {K}m) for m, n > 3.

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.

Nucleophosmin integrates within the nucleolus via multi-modal interactions with proteins displaying R-rich linear motifs and rRNA.

Science.gov (United States)

Mitrea, Diana M; Cika, Jaclyn A; Guy, Clifford S; Ban, David; Banerjee, Priya R; Stanley, Christopher B; Nourse, Amanda; Deniz, Ashok A; Kriwacki, Richard W

2016-02-02

The nucleolus is a membrane-less organelle formed through liquid-liquid phase separation of its components from the surrounding nucleoplasm. Here, we show that nucleophosmin (NPM1) integrates within the nucleolus via a multi-modal mechanism involving multivalent interactions with proteins containing arginine-rich linear motifs (R-motifs) and ribosomal RNA (rRNA). Importantly, these R-motifs are found in canonical nucleolar localization signals. Based on a novel combination of biophysical approaches, we propose a model for the molecular organization within liquid-like droplets formed by the N-terminal domain of NPM1 and R-motif peptides, thus providing insights into the structural organization of the nucleolus. We identify multivalency of acidic tracts and folded nucleic acid binding domains, mediated by N-terminal domain oligomerization, as structural features required for phase separation of NPM1 with other nucleolar components in vitro and for localization within mammalian nucleoli. We propose that one mechanism of nucleolar localization involves phase separation of proteins within the nucleolus.

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.

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.

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)

A 6-Nucleotide Regulatory Motif within the AbcR Small RNAs of Brucella abortus Mediates Host-Pathogen Interactions.

Science.gov (United States)

Sheehan, Lauren M; Caswell, Clayton C

2017-06-06

In Brucella abortus , two small RNAs (sRNAs), AbcR1 and AbcR2, are responsible for regulating transcripts encoding ABC-type transport systems. AbcR1 and AbcR2 are required for Brucella virulence, as a double chromosomal deletion of both sRNAs results in attenuation in mice. Although these sRNAs are responsible for targeting transcripts for degradation, the mechanism utilized by the AbcR sRNAs to regulate mRNA in Brucella has not been described. Here, two motifs (M1 and M2) were identified in AbcR1 and AbcR2, and complementary motif sequences were defined in AbcR-regulated transcripts. Site-directed mutagenesis of M1 or M2 or of both M1 and M2 in the sRNAs revealed transcripts to be targeted by one or both motifs. Electrophoretic mobility shift assays revealed direct, concentration-dependent binding of both AbcR sRNAs to a target mRNA sequence. These experiments genetically and biochemically characterized two indispensable motifs within the AbcR sRNAs that bind to and regulate transcripts. Additionally, cellular and animal models of infection demonstrated that only M2 in the AbcR sRNAs is required for Brucella virulence. Furthermore, one of the M2-regulated targets, BAB2_0612, was found to be critical for the virulence of B. abortus in a mouse model of infection. Although these sRNAs are highly conserved among Alphaproteobacteria , the present report displays how gene regulation mediated by the AbcR sRNAs has diverged to meet the intricate regulatory requirements of each particular organism and its unique biological niche. IMPORTANCE Small RNAs (sRNAs) are important components of bacterial regulation, allowing organisms to quickly adapt to changes in their environments. The AbcR sRNAs are highly conserved throughout the Alphaproteobacteria and negatively regulate myriad transcripts, many encoding ABC-type transport systems. In Brucella abortus , AbcR1 and AbcR2 are functionally redundant, as only a double abcR1 abcR2 ( abcR1 / 2 ) deletion results in attenuation in

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 ...

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.

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.

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 Q Motif Is Involved in DNA Binding but Not ATP Binding in ChlR1 Helicase.

Directory of Open Access Journals (Sweden)

Hao Ding

Full Text Available Helicases are molecular motors that couple the energy of ATP hydrolysis to the unwinding of structured DNA or RNA and chromatin remodeling. The conversion of energy derived from ATP hydrolysis into unwinding and remodeling is coordinated by seven sequence motifs (I, Ia, II, III, IV, V, and VI. The Q motif, consisting of nine amino acids (GFXXPXPIQ with an invariant glutamine (Q residue, has been identified in some, but not all helicases. Compared to the seven well-recognized conserved helicase motifs, the role of the Q motif is less acknowledged. Mutations in the human ChlR1 (DDX11 gene are associated with a unique genetic disorder known as Warsaw Breakage Syndrome, which is characterized by cellular defects in genome maintenance. To examine the roles of the Q motif in ChlR1 helicase, we performed site directed mutagenesis of glutamine to alanine at residue 23 in the Q motif of ChlR1. ChlR1 recombinant protein was overexpressed and purified from HEK293T cells. ChlR1-Q23A mutant abolished the helicase activity of ChlR1 and displayed reduced DNA binding ability. The mutant showed impaired ATPase activity but normal ATP binding. A thermal shift assay revealed that ChlR1-Q23A has a melting point value similar to ChlR1-WT. Partial proteolysis mapping demonstrated that ChlR1-WT and Q23A have a similar globular structure, although some subtle conformational differences in these two proteins are evident. Finally, we found ChlR1 exists and functions as a monomer in solution, which is different from FANCJ, in which the Q motif is involved in protein dimerization. Taken together, our results suggest that the Q motif is involved in DNA binding but not ATP binding in ChlR1 helicase.

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.

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\\.

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

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...

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].

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.

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...

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.

(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].

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

Science.gov (United States)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

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.

(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 Å].

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.

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...

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

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

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

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.

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 the domination and signed domination numbers of zero-divisor graph

Directory of Open Access Journals (Sweden)

Ebrahim Vatandoost

2016-10-01

Full Text Available Let $R$ be a commutative ring (with 1 and let $Z(R$ be its set of zero-divisors. The zero-divisor graph $\\Gamma(R$ has vertex set $Z^*(R=Z(R \\setminus \\lbrace0 \\rbrace$ and for distinct $x,y \\in Z^*(R$, the vertices $x$ and $y$ are adjacent if and only if $xy=0$. In this paper, we consider the domination number and signed domination number on zero-divisor graph $\\Gamma(R$ of commutative ring $R$ such that for every $0 \

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

(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.

Building a SuAVE browse interface to R2R's Linked Data

Science.gov (United States)

Clark, D.; Stocks, K. I.; Arko, R. A.; Zaslavsky, I.; Whitenack, T.

2017-12-01

The Rolling Deck to Repository program (R2R) is creating and evaluating a new browse portal based on the SuAVE platform and the R2R linked data graph. R2R manages the underway sensor data collected by the fleet of US academic research vessels, and provides a discovery and access point to those data at its website, www.rvdata.us. R2R has a database-driven search interface, but seeks a more capable and extensible browse interface that could be built off of the substantial R2R linked data resources. R2R's Linked Data graph organizes its data holdings around key concepts (e.g. cruise, vessel, device type, operator, award, organization, publication), anchored by persistent identifiers where feasible. The "Survey Analysis via Visual Exploration" or SuAVE platform (suave.sdsc.edu) is a system for online publication, sharing, and analysis of images and metadata. It has been implemented as an interface to diverse data collections, but has not been driven off of linked data in the past. SuAVE supports several features of interest to R2R, including faceted searching, collaborative annotations, efficient subsetting, Google maps-like navigation over an image gallery, and several types of data analysis. Our initial SuAVE-based implementation was through a CSV export from the R2R PostGIS-enabled PostgreSQL database. This served to demonstrate the utility of SuAVE but was static and required reloading as R2R data holdings grew. We are now working to implement a SPARQL-based ("RDF Query Language") service that directly leverages the R2R Linked Data graph and offers the ability to subset and/or customize output.We will show examples of SuAVE faceted searches on R2R linked data concepts, and discuss our experience to date with this work in progress.

(2E,4E-1-(2-Hydroxyphenyl-5-phenylpenta-2,4-dien-1-one

Directory of Open Access Journals (Sweden)

W. A. Silva

2011-09-01

Full Text Available In the structure of the title chalcone, C17H14O2, derived from cinnamaldehyde, the olefine group has a trans configuration. The molecular conformation is stabilized by an intramolecular O—H...O hydrogen-bond interaction with graph-set motif S(6.

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/

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

Multiple Copies of a Simple MYB-Binding Site Confers Trans-regulation by Specific Flavonoid-Related R2R3 MYBs in Diverse Species

Directory of Open Access Journals (Sweden)

Cyril Brendolise

2017-10-01

Full Text Available In apple, the MYB transcription factor MYB10 controls the accumulation of anthocyanins. MYB10 is able to auto-activate its expression by binding its own promoter at a specific motif, the R1 motif. In some apple accessions a natural mutation, termed R6, has more copies of this motif within the MYB10 promoter resulting in stronger auto-activation and elevated anthocyanins. Here we show that other anthocyanin-related MYBs selected from apple, pear, strawberry, petunia, kiwifruit and Arabidopsis are able to activate promoters containing the R6 motif. To examine the specificity of this motif, members of the R2R3 MYB family were screened against a promoter harboring the R6 mutation. Only MYBs from subgroups 5 and 6 activate expression by binding the R6 motif, with these MYBs sharing conserved residues in their R2R3 DNA binding domains. Insertion of the apple R6 motif into orthologous promoters of MYB10 in pear (PcMYB10 and Arabidopsis (AtMY75 elevated anthocyanin levels. Introduction of the R6 motif into the promoter region of an anthocyanin biosynthetic enzyme F3′5′H of kiwifruit imparts regulation by MYB10. This results in elevated levels of delphinidin in both tobacco and kiwifruit. Finally, an R6 motif inserted into the promoter the vitamin C biosynthesis gene GDP-L-Gal phosphorylase increases vitamin C content in a MYB10-dependent manner. This motif therefore provides a tool to re-engineer novel MYB-regulated responses in plants.

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...

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

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...

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.

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

Multicolored spanning subgraphs in G-colorings of complete graphs

International Nuclear Information System (INIS)

Akbari, S.; Zare, S.

2007-08-01

Let G = {g 1 , ..., g n } be a finite abelian group. Consider the complete graph with the vertex set {g 1 , ..., g n }}. The G-coloring of K n is a proper edge coloring in which the color of edge {g i , g j } is g i + g j , l ≤ i ≤ j ≤ n. We prove that in the G-coloring of the complete graph K n , there exists a multicolored Hamilton path if G is not an elementary abelian 2-group. Furthermore, we show that if n is odd, then the G-coloring of K n can be decomposed into multicolored 2-factors and if l r is the number of elements of order r in G, 3 ≤ r ≤ n. then there are exactly (l r )/2 multicolored r-uniform 2-factors in this decomposition. This provides a generalization of a recent result due to Constantine which states: For any prime number p > 2, there exists a proper edge coloring of K p which is decomposable into multicolored Hamilton cycles. (author)

Building pathway graphs from BioPAX data in R.

Science.gov (United States)

Benis, Nirupama; Schokker, Dirkjan; Kramer, Frank; Smits, Mari A; Suarez-Diez, Maria

2016-01-01

Biological pathways are increasingly available in the BioPAX format which uses an RDF model for data storage. One can retrieve the information in this data model in the scripting language R using the package rBiopaxParser , which converts the BioPAX format to one readable in R. It also has a function to build a regulatory network from the pathway information. Here we describe an extension of this function. The new function allows the user to build graphs of entire pathways, including regulated as well as non-regulated elements, and therefore provides a maximum of information. This function is available as part of the rBiopaxParser distribution from Bioconductor.

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$‎.

Commuting graphs of matrix algebras

International Nuclear Information System (INIS)

Akbari, S.; Bidkhori, H.; Mohammadian, A.

2006-08-01

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)

Characterization of the CrbS/R Two-Component System in Pseudomonas fluorescens Reveals a New Set of Genes under Its Control and a DNA Motif Required for CrbR-Mediated Transcriptional Activation

Directory of Open Access Journals (Sweden)

Edgardo Sepulveda

2017-11-01

Full Text Available The CrbS/R system is a two-component signal transduction system that regulates acetate utilization in Vibrio cholerae, P. aeruginosa, and P. entomophila. CrbS is a hybrid histidine kinase that belongs to a recently identified family, in which the signaling domain is fused to an SLC5 solute symporter domain through aSTAC domain. Upon activation by CrbS, CrbR activates transcription of the acs gene, which encodes an acetyl-CoA synthase (ACS, and the actP gene, which encodes an acetate/solute symporter. In this work, we characterized the CrbS/R system in Pseudomonas fluorescens SBW25. Through the quantitative proteome analysis of different mutants, we were able to identify a new set of genes under its control, which play an important role during growth on acetate. These results led us to the identification of a conserved DNA motif in the putative promoter region of acetate-utilization genes in the Gammaproteobacteria that is essential for the CrbR-mediated transcriptional activation of genes under acetate-utilizing conditions. Finally, we took advantage of the existence of a second SLC5-containing two-component signal transduction system in P. fluorescens, CbrA/B, to demonstrate that the activation of the response regulator by the histidine kinase is not dependent on substrate transport through the SLC5 domain.

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...

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).

Flow Cytometry-Assisted Cloning of Specific Sequence Motifs from Complex 16S rRNA Gene Libraries

DEFF Research Database (Denmark)

Nielsen, Jeppe Lund; Schramm, Andreas; Bernhard, Anne E.

2004-01-01

for Systems Biology,3 Seattle, Washington, and Department of Ecological Microbiology, University of Bayreuth, Bayreuth, Germany2 A flow cytometry method was developed for rapid screening and recovery of cloned DNA containing common sequence motifs. This approach, termed fluorescence-activated cell sorting......  FLOW CYTOMETRY-ASSISTED CLONING OF SPECIFIC SEQUENCE MOTIFS FROM COMPLEX 16S RRNA GENE LIBRARIES Jeppe L. Nielsen,1 Andreas Schramm,1,2 Anne E. Bernhard,1 Gerrit J. van den Engh,3 and David A. Stahl1* Department of Civil and Environmental Engineering, University of Washington,1 and Institute......-assisted cloning, was used to recover sequences affiliated with a unique lineage within the Bacteroidetes not abundant in a clone library of environmental 16S rRNA genes.  ...

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.

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.

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.

Improving Graduate Students' Graphing Skills of Multiple Baseline Designs with Microsoft[R] Excel 2007

Science.gov (United States)

Lo, Ya-yu; Starling, A. Leyf Peirce

2009-01-01

This study examined the effects of a graphing task analysis using the Microsoft[R] Office Excel 2007 program on the single-subject multiple baseline graphing skills of three university graduate students. Using a multiple probe across participants design, the study demonstrated a functional relationship between the number of correct graphing…

Comparative transcriptome analysis of oil palm flowers reveals an EAR-motif-containing R2R3-MYB that modulates phenylpropene biosynthesis.

Science.gov (United States)

Li, Ran; Reddy, Vaishnavi Amarr; Jin, Jingjing; Rajan, Chakaravarthy; Wang, Qian; Yue, Genhua; Lim, Chin Huat; Chua, Nam-Hai; Ye, Jian; Sarojam, Rajani

2017-11-23

Oil palm is the most productive oil crop and the efficiency of pollination has a direct impact on the yield of oil. Pollination by wind can occur but maximal pollination is mediated by the weevil E. kamerunicus. These weevils complete their life cycle by feeding on male flowers. Attraction of weevils to oil palm flowers is due to the emission of methylchavicol by both male and female flowers. In search for male flowers, the weevils visit female flowers by accident due to methylchavicol fragrance and deposit pollen. Given the importance of methylchavicol emission on pollination, we performed comparative transcriptome analysis of oil palm flowers and leaves to identify candidate genes involved in methylchavicol production in flowers. RNA sequencing (RNA-Seq) of male open flowers, female open flowers and leaves was performed using Illumina HiSeq 2000 platform. Analysis of the transcriptome data revealed that the transcripts of methylchavicol biosynthesis genes were strongly up-regulated whereas transcripts encoding genes involved in lignin production such as, caffeic acid O-methyltransferase (COMT) and Ferulate-5-hydroxylase (F5H) were found to be suppressed in oil palm flowers. Among the transcripts encoding transcription factors, an EAR-motif-containing R2R3-MYB transcription factor (EgMYB4) was found to be enriched in oil palm flowers. We determined that EgMYB4 can suppress the expression of a monolignol pathway gene, EgCOMT, in vivo by binding to the AC elements present in the promoter region. EgMYB4 was further functionally characterized in sweet basil which also produces phenylpropenes like oil palm. Transgenic sweet basil plants showed significant reduction in lignin content but produced more phenylpropenes. Our results suggest that EgMYB4 possibly restrains lignin biosynthesis in oil palm flowers thus allowing enhanced carbon flux into the phenylpropene pathway. This study augments our understanding of the diverse roles that EAR-motif-containing MYBs play to

Algorithms for Planar Graphs and Graphs in Metric Spaces

DEFF Research Database (Denmark)

Wulff-Nilsen, Christian

structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

Salt-bridge Swapping in the EXXERFXYY Motif of Proton Coupled Oligopeptide Transporters

DEFF Research Database (Denmark)

Aduri, Nanda G; Prabhala, Bala K; Ernst, Heidi A

2015-01-01

to as E1XXE2R), located on Helix I, in interactions with the proton. In this study we investigated the intracellular substrate accumulation by motif variants with all possible combinations of glutamate residues changed to glutamine and arginine changed to a tyrosine; the latter being a natural variant......-motif salt bridge, i.e. R-E2 to R-E1, which is consistent with previous structural studies. Molecular dynamics simulations of the motif variants E1XXE2R and E1XXQ2R support this mechanism. The simulations showed that upon changing conformation, arginine pushes Helix V, through interactions with the highly...

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.

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 Phenylpropanoid Pathway Is Controlled at Different Branches by a Set of R2R3-MYB C2 Repressors in Grapevine1

Science.gov (United States)

Cavallini, Erika; Matus, José Tomás; Finezzo, Laura; Zenoni, Sara; Loyola, Rodrigo; Guzzo, Flavia; Schlechter, Rudolf; Ageorges, Agnès; Arce-Johnson, Patricio

2015-01-01

Because of the vast range of functions that phenylpropanoids possess, their synthesis requires precise spatiotemporal coordination throughout plant development and in response to the environment. The accumulation of these secondary metabolites is transcriptionally controlled by positive and negative regulators from the MYB and basic helix-loop-helix protein families. We characterized four grapevine (Vitis vinifera) R2R3-MYB proteins from the C2 repressor motif clade, all of which harbor the ethylene response factor-associated amphiphilic repression domain but differ in the presence of an additional TLLLFR repression motif found in the strong flavonoid repressor Arabidopsis (Arabidopsis thaliana) AtMYBL2. Constitutive expression of VvMYB4a and VvMYB4b in petunia (Petunia hybrida) repressed general phenylpropanoid biosynthetic genes and selectively reduced the amount of small-weight phenolic compounds. Conversely, transgenic petunia lines expressing VvMYBC2-L1 and VvMYBC2-L3 showed a severe reduction in petal anthocyanins and seed proanthocyanidins together with a higher pH of crude petal extracts. The distinct function of these regulators was further confirmed by transient expression in tobacco (Nicotiana benthamiana) leaves and grapevine plantlets. Finally, VvMYBC2-L3 was ectopically expressed in grapevine hairy roots, showing a reduction in proanthocyanidin content together with the down-regulation of structural and regulatory genes of the flavonoid pathway as revealed by a transcriptomic analysis. The physiological role of these repressors was inferred by combining the results of the functional analyses and their expression patterns in grapevine during development and in response to ultraviolet B radiation. Our results indicate that VvMYB4a and VvMYB4b may play a key role in negatively regulating the synthesis of small-weight phenolic compounds, whereas VvMYBC2-L1 and VvMYBC2-L3 may additionally fine tune flavonoid levels, balancing the inductive effects of

On zero divisor graph of unique product monoid rings over Noetherian reversible ring

Directory of Open Access Journals (Sweden)

Ebrahim Hashemi

2016-02-01

Full Text Available Let $R$ be an associative ring with identity and $Z^*(R$ be its set of non-zero zero divisors.  The zero-divisor graph of $R$, denoted by $Gamma(R$, is the graph whose vertices are the non-zero  zero-divisors of  $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$.  In this paper, we bring some results about undirected zero-divisor graph of a monoid ring over reversible right (or left Noetherian ring $R$. We essentially classify the diameter-structure of this graph and show that $0leq mbox{diam}(Gamma(Rleq mbox{diam}(Gamma(R[M]leq 3$. Moreover, we give a characterization for the possible diam$(Gamma(R$ and diam$(Gamma(R[M]$, when $R$ is a reversible Noetherian ring and $M$ is a u.p.-monoid. Also, we study relations between the girth of $Gamma(R$ and that of $Gamma(R[M]$.

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].

On The Roman Domination Stable Graphs

Directory of Open Access Journals (Sweden)

Hajian Majid

2017-11-01

Full Text Available A Roman dominating function (or just RDF on a graph G = (V,E is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u = 0 is adjacent to at least one vertex v for which f(v = 2. The weight of an RDF f is the value f(V (G = Pu2V (G f(u. The Roman domination number of a graph G, denoted by R(G, is the minimum weight of a Roman dominating function on G. A graph G is Roman domination stable if the Roman domination number of G remains unchanged under removal of any vertex. In this paper we present upper bounds for the Roman domination number in the class of Roman domination stable graphs, improving bounds posed in [V. Samodivkin, Roman domination in graphs: the class RUV R, Discrete Math. Algorithms Appl. 8 (2016 1650049].

Regulation of synaptic inhibition by phospho-dependent binding of the AP2 complex to a YECL motif in the GABAA receptor gamma2 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-03-04

The regulation of the number of gamma2-subunit-containing GABA(A) receptors (GABA(A)Rs) 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 gamma2-subunit-containing GABA(A)Rs is regulated. Here, we identify a gamma2-subunit-specific Yxxvarphi-type-binding motif for the clathrin adaptor protein, AP2, which is located within a site for gamma2-subunit tyrosine phosphorylation. Blocking GABA(A)R-AP2 interactions via this motif increases synaptic responses within minutes. Crystallographic and biochemical studies reveal that phosphorylation of the Yxxvarphi 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 gamma2-subunit-containing heteromeric GABA(A)Rs may be internalized as dimers or multimers. These data define a mechanism for tyrosine kinase regulation of GABA(A)R surface levels and synaptic inhibition.

A Single Session of rTMS Enhances Small-Worldness in Writer’s Cramp: Evidence from Simultaneous EEG-fMRI Multi-Modal Brain Graph

Directory of Open Access Journals (Sweden)

Rose D. Bharath

2017-09-01

Full Text Available Background and Purpose: Repetitive transcranial magnetic stimulation (rTMS induces widespread changes in brain connectivity. As the network topology differences induced by a single session of rTMS are less known we undertook this study to ascertain whether the network alterations had a small-world morphology using multi-modal graph theory analysis of simultaneous EEG-fMRI.Method: Simultaneous EEG-fMRI was acquired in duplicate before (R1 and after (R2 a single session of rTMS in 14 patients with Writer’s Cramp (WC. Whole brain neuronal and hemodynamic network connectivity were explored using the graph theory measures and clustering coefficient, path length and small-world index were calculated for EEG and resting state fMRI (rsfMRI. Multi-modal graph theory analysis was used to evaluate the correlation of EEG and fMRI clustering coefficients.Result: A single session of rTMS was found to increase the clustering coefficient and small-worldness significantly in both EEG and fMRI (p < 0.05. Multi-modal graph theory analysis revealed significant modulations in the fronto-parietal regions immediately after rTMS. The rsfMRI revealed additional modulations in several deep brain regions including cerebellum, insula and medial frontal lobe.Conclusion: Multi-modal graph theory analysis of simultaneous EEG-fMRI can supplement motor physiology methods in understanding the neurobiology of rTMS in vivo. Coinciding evidence from EEG and rsfMRI reports small-world morphology for the acute phase network hyper-connectivity indicating changes ensuing low-frequency rTMS is probably not “noise”.

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$.

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.

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.

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.

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 dictionary between R-operators, on-shell graphs and Yangian algebras

Energy Technology Data Exchange (ETDEWEB)

Broedel, Johannes; Leeuw, Marius de; Rosso, Matteo [Institut für Theoretische Physik, Eidgenössische Technische Hochschule Zürich,Wolfgang-Pauli-Strasse 27, 8093 Zürich (Switzerland)

2014-06-27

We translate between different formulations of Yangian invariants relevant for the computation of tree-level scattering amplitudes in N=4 super-Yang–Mills theory. While the R-operator formulation allows to relate scattering amplitudes to structures well known from integrability, it can equally well be connected to the permutations encoded by on-shell graphs.

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.

A generalization of total graphs

Indian Academy of Sciences (India)

M Afkhami

2018-04-12

Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.

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.

Dominating sets of the comaximal and ideal-based zero-divisor ...

African Journals Online (AJOL)

Let R be a commutative ring with nonzero identity, and let I be an ideal of R. The ideal-based zero-divisor graph of R, denoted by ΓI (R), is the graph whose vertices are the set {x ∈ R \\ I| xy ∈ I for some y ∈ R \\ I} and two distinct vertices x and y are adjacent if and only if xy ∈ I. Define the comaximal graph of R, denoted by ...

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.

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...

Towards characterizing graphs with a sliceable rectangular dual

NARCIS (Netherlands)

Kusters, V.; Speckmann, B.; Di Giacomo, E.; Lubiw, A.

2015-01-01

Let G be a plane triangulated graph. A rectangular dual of G is a partition of a rectangle R into a set R of interior-disjoint rectangles, one for each vertex, such that two regions are adjacent if and only if the corresponding vertices are connected by an edge. A rectangular dual is sliceable if it

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-...

Packing Degenerate Graphs Greedily

Czech Academy of Sciences Publication Activity Database

Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana

2017-01-01

Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics

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

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

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.

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.

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.

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.

A cognitive architecture-based model of graph comprehension

OpenAIRE

Peebles, David

2012-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 extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated during t...

The Fibonacci numbers of certain subgraphs of circulant graphs

Directory of Open Access Journals (Sweden)

Loiret Alejandría Dosal-Trujillo

2015-11-01

We prove that the total number of independent vertex sets of the family of graphs Cn[r] for all n≥r+1, and for several subgraphs of this family is completely determined by some sequences which are constructed recursively like the Fibonacci and Lucas sequences, even more, these new sequences generalize the Fibonacci and Lucas sequences.

(1S*,2S*,4R*,5R*-Cyclohexane-1,2,4,5-tetracarboxylic acid

Directory of Open Access Journals (Sweden)

Akira Uchida

2014-01-01

Full Text Available The title compound, C10H12O8, a prospective raw material for colourless polyimides which are applied to electronic and microelectronic devices, lies about an inversion centre and the cyclohexane ring adopts a chair conformation. Two crystallographycally independent carboxylic acid groups on adjacent C atoms are in equatorial positions, resulting in a mutually trans conformation. In the crystal, O—H...O hydrogen bonds around an inversion centre and a threefold rotoinversion axis, respectively, form an inversion dimer with an R22(8 motif and a trimer with an R33(12 motif.

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/

Preorganization of the catalytic Zn2+-binding site in the HNH nuclease motif-A solution study

Czech Academy of Sciences Publication Activity Database

Németh, E.; Kožíšek, Milan; Schilli, G. K.; Gyurcsik, B.

2015-01-01

Roč. 151, Oct (2015), s. 143-149 ISSN 0162-0134 R&D Projects: GA MŠk LO1302 Institutional support: RVO:61388963 Keywords : HNH-motif * metallonuclease * Zn2+-binding * protein folding * ITC Subject RIV: CE - Biochemistry Impact factor: 3.205, year: 2015

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).

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\

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....

Subdominant pseudoultrametric on graphs

Energy Technology Data Exchange (ETDEWEB)

Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)

2013-08-31

Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.

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.

a generalization of zero divisor graphs associated to commutative

Indian Academy of Sciences (India)

8

R is isomorphic to the zero divisor graph Γ(R), and so Γn. R is a generalization of Γ(R) which is called a generalized zero divisor graph of R. In this paper, we study some basic properties of Γn. R. We also determine all isomorphic classes of finite commutative rings whose generalized zero divisor graphs have genus at most ...

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.

Interactions between the R2R3-MYB transcription factor, AtMYB61, and target DNA binding sites.

Directory of Open Access Journals (Sweden)

Michael B Prouse

Full Text Available Despite the prominent roles played by R2R3-MYB transcription factors in the regulation of plant gene expression, little is known about the details of how these proteins interact with their DNA targets. For example, while Arabidopsis thaliana R2R3-MYB protein AtMYB61 is known to alter transcript abundance of a specific set of target genes, little is known about the specific DNA sequences to which AtMYB61 binds. To address this gap in knowledge, DNA sequences bound by AtMYB61 were identified using cyclic amplification and selection of targets (CASTing. The DNA targets identified using this approach corresponded to AC elements, sequences enriched in adenosine and cytosine nucleotides. The preferred target sequence that bound with the greatest affinity to AtMYB61 recombinant protein was ACCTAC, the AC-I element. Mutational analyses based on the AC-I element showed that ACC nucleotides in the AC-I element served as the core recognition motif, critical for AtMYB61 binding. Molecular modelling predicted interactions between AtMYB61 amino acid residues and corresponding nucleotides in the DNA targets. The affinity between AtMYB61 and specific target DNA sequences did not correlate with AtMYB61-driven transcriptional activation with each of the target sequences. CASTing-selected motifs were found in the regulatory regions of genes previously shown to be regulated by AtMYB61. Taken together, these findings are consistent with the hypothesis that AtMYB61 regulates transcription from specific cis-acting AC elements in vivo. The results shed light on the specifics of DNA binding by an important family of plant-specific transcriptional regulators.

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 .

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

Note on Ideal Based Zero-Divisor Graph of a Commutative Ring

Directory of Open Access Journals (Sweden)

Mallika A.

2017-12-01

Full Text Available In this paper, we consider the ideal based zero divisor graph ΓI(R of a commutative ring R. We discuss some graph theoretical properties of ΓI(R in relation with zero divisor graph. We also relate certain parameters like vertex chromatic number, maximum degree and minimum degree for the graph ΓI(R with that of Γ(R/I . Further we determine a necessary and sufficient condition for the graph to be Eulerian and regular.

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

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...

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...

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.

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.

BMI-for-age graphs with severe obesity percentile curves: tools for plotting cross-sectional and longitudinal youth BMI data.

Science.gov (United States)

Racette, Susan B; Yu, Liyang; DuPont, Nicholas C; Clark, B Ruth

2017-05-24

Severe obesity is an important and distinct weight status classification that is associated with disease risk and is increasing in prevalence among youth. The ability to graphically present population weight status data, ranging from underweight through severe obesity class 3, is novel and applicable to epidemiologic research, intervention studies, case reports, and clinical care. The aim was to create body mass index (BMI) graphing tools to generate sex-specific BMI-for-age graphs that include severe obesity percentile curves. We used the Centers for Disease Control and Prevention youth reference data sets and weight status criteria to generate the percentile curves. The statistical software environments SAS and R were used to create two different graphing options. This article provides graphing tools for creating sex-specific BMI-for-age graphs for males and females ages 2 to obesity classes 2 and 3, the ability to plot individual data for thousands of children and adolescents on a single graph, and the ability to generate cross-sectional and longitudinal graphs. These new BMI graphing tools will enable investigators, public health professionals, and clinicians to view and present youth weight status data in novel and meaningful ways.

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

[r,s,t]-colourings of paths

Directory of Open Access Journals (Sweden)

Marta Salvador Villà

2007-01-01

Full Text Available The concept of \\([r,s,t]\\-colourings was recently introduced by Hackmann, Kemnitz and Marangio [A. Kemnitz, M. Marangio, \\([r,s,t]\\-Colorings of Graphs, Discrete Math., to appear] as follows: Given non-negative integers \\(r\\, \\(s\\ and \\(t\\, an \\([r,s,t]\\-colouring of a graph \\(G=(V(G,E(G\\ is a mapping \\(c\\ from \\(V(G \\cup E(G\\ to the colour set \\(\\{1,2,\\ldots ,k\\}\\ such that \\(|c(v_i-c(v_j| \\geq r\\ for every two adjacent vertices \\(v_i\\, \\(v_j\\, \\(|c(e_i-c(e_j| \\geq s\\ for every two adjacent edges \\(e_i\\, \\(e_j\\, and \\(|c(v_i-c(e_j| \\geq t\\ for all pairs of incident vertices and edges, respectively. The \\([r,s,t]\\-chromatic number \\(\\chi_{r,s,t}(G\\ of \\(G\\ is defined to be the minimum \\(k\\ such that \\(G\\ admits an \\([r,s,t]\\-colouring. In this paper, we determine the \\([r,s,t]\\-chromatic number for paths.

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.

An intersection graph of straight lines

DEFF Research Database (Denmark)

Thomassen, Carsten

2002-01-01

G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....

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.

The Ramsey numbers of fans versus a complete graph of order five

Directory of Open Access Journals (Sweden)

Yanbo Zhang

2014-04-01

Full Text Available For two given graphs $F$ and $H$, the Ramsey number $R(F,H$ is the smallest integer $N$ such that for any graph $G$ of order $N$, either $G$ contains $F$ or the complement of $G$ contains $H$. Let $F_l$ denote a fan of order $2l+1$, which is $l$ triangles sharing exactly one vertex, and $K_n$ a complete graph of order $n$. Surahmat et al. conjectured that $R(F_l,K_n=2l(n-1+1$ for $l\\geq n\\geq 5$. In this paper, we show that the conjecture is true for n=5.

Fox-2 Splicing Factor Binds to a Conserved Intron Motif to PromoteInclusion of Protein 4.1R Alternative Exon 16

Energy Technology Data Exchange (ETDEWEB)

Ponthier, Julie L.; Schluepen, Christina; Chen, Weiguo; Lersch,Robert A.; Gee, Sherry L.; Hou, Victor C.; Lo, Annie J.; Short, Sarah A.; Chasis, Joel A.; Winkelmann, John C.; Conboy, John G.

2006-03-01

Activation of protein 4.1R exon 16 (E16) inclusion during erythropoiesis represents a physiologically important splicing switch that increases 4.1R affinity for spectrin and actin. Previous studies showed that negative regulation of E16 splicing is mediated by the binding of hnRNP A/B proteins to silencer elements in the exon and that downregulation of hnRNP A/B proteins in erythroblasts leads to activation of E16 inclusion. This paper demonstrates that positive regulation of E16 splicing can be mediated by Fox-2 or Fox-1, two closely related splicing factors that possess identical RNA recognition motifs. SELEX experiments with human Fox-1 revealed highly selective binding to the hexamer UGCAUG. Both Fox-1 and Fox-2 were able to bind the conserved UGCAUG elements in the proximal intron downstream of E16, and both could activate E16 splicing in HeLa cell co-transfection assays in a UGCAUG-dependent manner. Conversely, knockdown of Fox-2 expression, achieved with two different siRNA sequences resulted in decreased E16 splicing. Moreover, immunoblot experiments demonstrate mouse erythroblasts express Fox-2, but not Fox-1. These findings suggest that Fox-2 is a physiological activator of E16 splicing in differentiating erythroid cells in vivo. Recent experiments show that UGCAUG is present in the proximal intron sequence of many tissue-specific alternative exons, and we propose that the Fox family of splicing enhancers plays an important role in alternative splicing switches during differentiation in metazoan organisms.

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

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.

Motif discovery in ranked lists of sequences

DEFF Research Database (Denmark)

Nielsen, Morten Muhlig; Tataru, Paula; Madsen, Tobias

2016-01-01

Motif analysis has long been an important method to characterize biological functionality and the current growth of sequencing-based genomics experiments further extends its potential. These diverse experiments often generate sequence lists ranked by some functional property. There is therefore...... advantage of the regular expression feature, including enrichments for combinations of different microRNA seed sites. The method is implemented and made publicly available as an R package and supports high parallelization on multi-core machinery....... a growing need for motif analysis methods that can exploit this coupled data structure and be tailored for specific biological questions. Here, we present an exploratory motif analysis tool, Regmex (REGular expression Motif EXplorer), which offers several methods to evaluate the correlation of motifs...

OSR1 regulates a subset of inward rectifier potassium channels via a binding motif variant.

Science.gov (United States)

Taylor, Clinton A; An, Sung-Wan; Kankanamalage, Sachith Gallolu; Stippec, Steve; Earnest, Svetlana; Trivedi, Ashesh T; Yang, Jonathan Zijiang; Mirzaei, Hamid; Huang, Chou-Long; Cobb, Melanie H

2018-04-10

The with-no-lysine (K) (WNK) signaling pathway to STE20/SPS1-related proline- and alanine-rich kinase (SPAK) and oxidative stress-responsive 1 (OSR1) kinase is an important mediator of cell volume and ion transport. SPAK and OSR1 associate with upstream kinases WNK 1-4, substrates, and other proteins through their C-terminal domains which interact with linear R-F-x-V/I sequence motifs. In this study we find that SPAK and OSR1 also interact with similar affinity with a motif variant, R-x-F-x-V/I. Eight of 16 human inward rectifier K + channels have an R-x-F-x-V motif. We demonstrate that two of these channels, Kir2.1 and Kir2.3, are activated by OSR1, while Kir4.1, which does not contain the motif, is not sensitive to changes in OSR1 or WNK activity. Mutation of the motif prevents activation of Kir2.3 by OSR1. Both siRNA knockdown of OSR1 and chemical inhibition of WNK activity disrupt NaCl-induced plasma membrane localization of Kir2.3. Our results suggest a mechanism by which WNK-OSR1 enhance Kir2.1 and Kir2.3 channel activity by increasing their plasma membrane localization. Regulation of members of the inward rectifier K + channel family adds functional and mechanistic insight into the physiological impact of the WNK pathway.

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 ...

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.

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...

Ranking docking poses by graph matching of protein-ligand interactions: lessons learned from the D3R Grand Challenge 2

Science.gov (United States)

da Silva Figueiredo Celestino Gomes, Priscila; Da Silva, Franck; Bret, Guillaume; Rognan, Didier

2018-01-01

A novel docking challenge has been set by the Drug Design Data Resource (D3R) in order to predict the pose and affinity ranking of a set of Farnesoid X receptor (FXR) agonists, prior to the public release of their bound X-ray structures and potencies. In a first phase, 36 agonists were docked to 26 Protein Data Bank (PDB) structures of the FXR receptor, and next rescored using the in-house developed GRIM method. GRIM aligns protein-ligand interaction patterns of docked poses to those of available PDB templates for the target protein, and rescore poses by a graph matching method. In agreement with results obtained during the previous 2015 docking challenge, we clearly show that GRIM rescoring improves the overall quality of top-ranked poses by prioritizing interaction patterns already visited in the PDB. Importantly, this challenge enables us to refine the applicability domain of the method by better defining the conditions of its success. We notably show that rescoring apolar ligands in hydrophobic pockets leads to frequent GRIM failures. In the second phase, 102 FXR agonists were ranked by decreasing affinity according to the Gibbs free energy of the corresponding GRIM-selected poses, computed by the HYDE scoring function. Interestingly, this fast and simple rescoring scheme provided the third most accurate ranking method among 57 contributions. Although the obtained ranking is still unsuitable for hit to lead optimization, the GRIM-HYDE scoring scheme is accurate and fast enough to post-process virtual screening data.

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

A Median-Type Condition for Graph Tiling

Czech Academy of Sciences Publication Activity Database

Piguet, Diana; Saumell, Maria

2017-01-01

Roč. 61, August (2017), s. 979-985 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Grant - others:GA MŠk(CZ) LO1506 Institutional support: RVO:67985807 Keywords : extremal graph theory * graph tiling * regularity lemma * LP-duality Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics

The 3,7-diazabicyclo[3.3.1]nonane scaffold for subtype selective nicotinic acetylcholine receptor ligands. Part 2: carboxamide derivatives with different spacer motifs.

Science.gov (United States)

Eibl, Christoph; Munoz, Lenka; Tomassoli, Isabelle; Stokes, Clare; Papke, Roger L; Gündisch, Daniela

2013-12-01

3,7-Diazabicyclo[3.3.1]nonane (bispidine) based nicotinic acetylcholine receptor (nAChR) ligands have been synthesized and evaluated for nAChRs interaction. Diverse spacer motifs were incorporated between the hydrogen bond acceptor (HBA) part and a variety of substituted (hetero)aryl moieties. Bispidine carboxamides bearing spacer motifs often showed high affinity in the low nanomolar range and selectivity for the α4β2(∗) nAChR. Compounds 15, 25, and 47 with Ki values of about 1 nM displayed the highest affinities for α4β2(∗) nAChR. All evaluated compounds are partial agonists or antagonists at α4β2(∗), with reduced or no effects on α3β4(∗) with the exception of compound 15 (agonist), and reduced or no effect at α7 and muscle subtypes. Copyright © 2013 Elsevier Ltd. All rights reserved.

Development of the fast reactor group constant set JFS-3-J3.2R based on the JENDL-3.2

CERN Document Server

Chiba, G

2002-01-01

It is reported that the fast reactor group constant set JFS-3-J3.2 based on the newest evaluated nuclear data library JENDL3.2 has a serious error in the process of applying the weighting function. As the error affects greatly nuclear characteristics, and a corrected version of the reactor constant set, JFS-3-J3.2R, was developed, as well as lumped FP cross sections. The use of JFS-3-J3.2R improves the results of analyses especially on sample Doppler reactivity and reaction rate in the blanket region in comparison with those obtained using the JFS-3-J3.2.

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

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.

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...

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...

Cliques in dense inhomogenous random graphs

Czech Academy of Sciences Publication Activity Database

Doležal, Martin; Hladký, Jan; Máthé, A.

2017-01-01

Roč. 51, č. 2 (2017), s. 275-314 ISSN 1042-9832 R&D Projects: GA ČR GA16-07378S EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 Keywords : inhomogeneous random graphs * clique number Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.243, year: 2016 http://onlinelibrary.wiley.com/doi/10.1002/ rsa .20715/abstract

Cliques in dense inhomogenous random graphs

Czech Academy of Sciences Publication Activity Database

Doležal, Martin; Hladký, Jan; Máthé, A.

2017-01-01

Roč. 51, č. 2 (2017), s. 275-314 ISSN 1042-9832 R&D Projects: GA ČR GA16-07378S EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 Keywords : inhomogeneous random graphs * clique number Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.243, year: 2016 http://onlinelibrary.wiley.com/doi/10.1002/rsa.20715/abstract

An R2R3-MYB transcription factor, OjMYB1, functions in anthocyanin biosynthesis in Oenanthe javanica.

Science.gov (United States)

Feng, Kai; Xu, Zhi-Sheng; Que, Feng; Liu, Jie-Xia; Wang, Feng; Xiong, Ai-Sheng

2018-02-01

This study showed that an R2R3-MYB transcription factor, OjMYB1, is involved in anthocyanin biosynthesis and accumulation in Oenanthe javanica. Anthocyanins can be used as safe natural food colorants, obtained from many plants. R2R3-MYB transcription factors (TFs) play important roles in anthocyanins biosynthesis during plant development. Oenanthe javanica is a popular vegetable with high nutritional values and numerous medical functions. O. javanica has purple petioles that are mainly due to anthocyanins accumulation. In the present study, the gene encoding an R2R3-MYB TF, OjMYB1, was isolated from purple O. javanica. Sequencing results showed that OjMYB1 contained a 912-bp open reading frame encoding 303 amino acids. Sequence alignments revealed that OjMYB1 contained bHLH-interaction motif ([DE]Lx2[RK]x3Lx6Lx3R) and ANDV motif ([A/G]NDV). Phylogenetic analysis indicated that the OjMYB1 classified into the anthocyanins biosynthesis clade. Subcellular localization assay showed that OjMYB1 was a nuclear protein in vivo. The heterologous expression of OjMYB1 in Arabidopsis could enhance the anthocyanins content and up-regulate the expression levels of the structural genes-related anthocyanins biosynthesis. Yeast two-hybrid assay indicated that OjMYB1 could interact with AtTT8 and AtEGL3 proteins. Enzymatic analysis revealed that overexpression of OjMYB1 gene up-regulated the enzyme activity of 3-O-glycosyltransferase encoded by AtUGT78D2 in transgenic Arabidopsis. Our results provided a comprehensive understanding of the structure and function of OjMYB1 TF in O. javanica.

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.

Crystal structure, Hirshfeld analysis and molecular docking with the vascular endothelial growth factor receptor-2 of (3Z-5-fluoro-3-(hydroxyiminoindolin-2-one

Directory of Open Access Journals (Sweden)

Bianca Barreto Martins

2017-07-01

Full Text Available The reaction between 5-fluoroisatin and hydroxylamine hydrochloride in acidic ethanol yields the title compound, C8H5FN2O2, whose molecular structure matches the asymmetric unit and is nearly planar with an r.m.s. deviation for the mean plane through all non-H atoms of 0.0363 Å. In the crystal, the molecules are linked by N—H...N, N—H...O and O—H...O hydrogen-bonding interactions into a two-dimensional network along the (100 plane, forming rings with R22(8 and R12(5 graph-set motifs. The crystal packing also features weak π–π interactions along the [100] direction [centroid-to-centroid distance 3.9860 (5 Å]. Additionally, the Hirshfeld surface analysis indicates that the major contributions for the crystal structure are the O...H (28.50% and H...F (16.40% interactions. An in silico evaluation of the title compound with the vascular endothelial growth factor receptor-2 (VEGFR-2 was carried out. The title compound and the selected biological target VEGFR-2 show the N—H...O(GLU94, (CYS96N—H...O(isatine and (PHE95N—H...O(isatine intermolecular interactions, which suggests a solid theoretical structure–activity relationship.

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) &#...

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.

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.

CpG oligodeoxynucleotides containing GACGTT motifs enhance the immune responses elicited by a goose parvovirus vaccine in ducks.

Science.gov (United States)

Lee, Jai-Wei; Lin, Yu-Ming; Yen, Ting-Ying; Yang, Wen-Jen; Chu, Chun-Yen

2010-11-23

Recombinant parvovirus VP2 (rVP2) was formulated with different types of adjuvant, including aluminum adjuvant and CpG oligodeoxynucleotides (ODNs), and the immunological responses after vaccination in ducks were examined. In comparison with the control group, production of rVP2-specific antibodies, expression of cytokines in peripheral blood mononuclear cells (PBMC) stimulated by rVP2, and percentage of CD4(+)/CD8(+) cells in PBMC were significantly increased in ducks immunized with rVP2 formulated with CpG ODNs containing 3 copies of GACGTT motif. CpG ODNs with GACGTT motifs might be used to improve the efficacy of vaccines for ducks. Copyright © 2010 Elsevier Ltd. All rights reserved.

The complexity of proving that a graph is Ramsey

Czech Academy of Sciences Publication Activity Database

Lauria, M.; Pudlák, Pavel; Rödl, V.; Thapen, Neil

2017-01-01

Roč. 37, č. 2 (2017), s. 253-268 ISSN 0209-9683 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : complexity * c-Ramsey graphs Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.048, year: 2016 http://link.springer.com/article/10.1007%2Fs00493-015-3193-9

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.

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}$.

The forwarding indices of graphs - a survey

Directory of Open Access Journals (Sweden)

Jun-Ming Xu

2013-01-01

Full Text Available A routing \\(R\\ of a connected graph \\(G\\ of order \\(n\\ is a collection of \\(n(n-1\\ simple paths connecting every ordered pair of vertices of \\(G\\. The vertex-forwarding index \\(\\xi(G,R\\ of \\(G\\ with respect to a routing \\(R\\ is defined as the maximum number of paths in \\(R\\ passing through any vertex of \\(G\\. The vertex-forwarding index \\(\\xi(G\\ of \\(G\\ is defined as the minimum \\(\\xi(G,R\\ over all routings \\(R\\ of \\(G\\. Similarly, the edge-forwarding index \\(\\pi(G,R\\ of \\(G\\ with respect to a routing \\(R\\ is the maximum number of paths in \\(R\\ passing through any edge of \\(G\\. The edge-forwarding index \\(\\pi(G\\ of \\(G\\ is the minimum \\(\\pi(G,R\\ over all routings \\(R\\ of \\(G\\. The vertex-forwarding index or the edge-forwarding index corresponds to the maximum load of the graph. Therefore, it is important to find routings minimizing these indices and thus has received much research attention for over twenty years. This paper surveys some known results on these forwarding indices, further research problems and several conjectures, also states some difficulty and relations to other topics in graph theory.

Calcium Sensing Receptor Mutations Implicated in Pancreatitis and Idiopathic Epilepsy Syndrome Disrupt an Arginine-rich Retention Motif

Science.gov (United States)

Stepanchick, Ann; McKenna, Jennifer; McGovern, Olivia; Huang, Ying; Breitwieser, Gerda E.

2010-01-01

Calcium sensing receptor (CaSR) mutations implicated in familial hypocalciuric hypercalcemia, pancreatitis and idiopathic epilepsy syndrome map to an extended arginine-rich region in the proximal carboxyl terminus. Arginine-rich motifs mediate endoplasmic reticulum retention and/or retrieval of multisubunit proteins so we asked whether these mutations, R886P, R896H or R898Q, altered CaSR targeting to the plasma membrane. Targeting was enhanced by all three mutations, and Ca2+-stimulated ERK1/2 phosphorylation was increased for R896H and R898Q. To define the role of the extended arginine-rich region in CaSR trafficking, we independently determined the contributions of R890/R891 and/or R896/K897/R898 motifs by mutation to alanine. Disruption of the motif(s) significantly increased surface expression and function relative to wt CaSR. The arginine-rich region is flanked by phosphorylation sites at S892 (protein kinase C) and S899 (protein kinase A). The phosphorylation state of S899 regulated recognition of the arginine-rich region; S899D showed increased surface localization. CaSR assembles in the endoplasmic reticulum as a covalent disulfide-linked dimer and we determined whether retention requires the presence of arginine-rich regions in both subunits. A single arginine-rich region within the dimer was sufficient to confer intracellular retention comparable to wt CaSR. We have identified an extended arginine-rich region in the proximal carboxyl terminus of CaSR (residues R890 - R898) which fosters intracellular retention of CaSR and is regulated by phosphorylation. Mutation(s) identified in chronic pancreatitis and idiopathic epilepsy syndrome therefore increase plasma membrane targeting of CaSR, likely contributing to the altered Ca2+ signaling characteristic of these diseases. PMID:20798521

3-Ethylindan-1-one

Directory of Open Access Journals (Sweden)

Marcel Sonneck

2017-11-01

Full Text Available The title compound, C11H12O, has been prepared as a side product in the attempted room-temperature synthesis of (E-1-phenylpent-2-en-1-one. The molecular structure consists of an approximately planar indanone core (r.m.s. deviation = 0.042 Å with the ethyl group protruding from this plane. In the crystal, centrosymmetrically related molecules are linked into dimers by pairs of C—H...O hydrogen bonds, forming rings of R22(10 graph-set motif. The dimers are further connected by C—H...π interactions into chains running parallel to [-101].

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.

A self-assembling peptide RADA16-I integrated with spider fibroin uncrystalline motifs

Directory of Open Access Journals (Sweden)

Sun L

2012-02-01

Full Text Available Lijuan Sun1,2, Xiaojun Zhao1,31West China Hospital Laboratory of Nanomedicine and Institute for Nanobiomedical Technology and Membrane Biology, Sichuan University, Chengdu 610041, Sichuan, China; 2Dept of Oral and Maxillofacial Surgery, Sun Yat-sen Memorial Hospital, Sun Yat-sen University, Guangzhou 510120, Guangdong, China; 3Center for Biomedical Engineering NE47-378, Massachusetts Institute of Technology, Cambridge, MA 02139-4307, USAAbstract: Mechanical strength of nanofiber scaffolds formed by the self-assembling peptide RADA16-I or its derivatives is not very good and limits their application. To address this problem, we inserted spidroin uncrystalline motifs, which confer incomparable elasticity and hydrophobicity to spider silk GGAGGS or GPGGY, into the C-terminus of RADA16-I to newly design two peptides: R3 (n-RADARADARADARADA-GGAGGS-c and R4 (n-RADARADARADARADA-GPGGY-c, and then observed the effect of these motifs on biophysical properties of the peptide. Atomic force microscopy, transmitting electron microscopy, and circular dichroism spectroscopy confirm that R3 and R4 display ß-sheet structure and self-assemble into long nanofibers. Compared with R3, the ß-sheet structure and nanofibers formed by R4 are more stable; they change to random coil and unordered aggregation at higher temperature. Rheology measurements indicate that novel peptides form hydrogel when induced by DMEM, and the storage modulus of R3 and R4 hydrogel is 0.5 times and 3 times higher than that of RADA16-I, respectively. Furthermore, R4 hydrogel remarkably promotes growth of liver cell L02 and liver cancer cell SMCC7721 compared with 2D culture, determined by MTT assay. Novel peptides still have potential as hydrophobic drug carriers; they can stabilize pyrene microcrystals in aqueous solution and deliver this into a lipophilic environment, identified by fluorescence emission spectra. Altogether, the spider fibroin motif GPGGY most effectively enhances mechanical

Febuxostat-Minoxidil Salt Solvates: Crystal Structures, Characterization, Interconversion and Solubility Performance

Directory of Open Access Journals (Sweden)

Li-Yang Li

2018-02-01

Full Text Available Three febuxostat-minoxidil salt solvates with acetone (ACE, tetrahydrofuran (THF and isopropanol (IPA are synthesized by solvent-assisted grinding and characterized by infrared (IR, nuclear magnetic resonance (1H-NMR, single crystal and powder X-ray diffraction (PXRD, thermogravimetry (TG and differential scanning calorimetry (DSC. These febuxostat-minoxidil salt solvates feature isostructural with the same stoichiometries (1:1:1 molecule ratio. The proton transfers from the carboxylic group of febuxostat (FEB to imino N atom of minoxidil (MIN, which forms the motif with combined R 2 2 (9 R 4 2 (8 R 2 2 (9 graph set in the three solvates. The solvents occupy the different positions related to the motif, which results in the apparent differences in PXRD patterns before/after desolvation although they are isostructures. The FEB-MIN·THF was more thermostable than FEB-MIN·ACE and FEB-MIN·IPA relative to solvent removal from DSC patterns, which is different from the results from the solvent-exchange experiments in chemical kinetics. All three salt solvates exhibit increased equilibrium solubility compared to FEB in aqueous medium.

γ-Aminobutyric Acid Type B (GABAB) Receptor Internalization Is Regulated by the R2 Subunit*

Science.gov (United States)

Hannan, Saad; Wilkins, Megan E.; Dehghani-Tafti, Ebrahim; Thomas, Philip; Baddeley, Stuart M.; Smart, Trevor G.

2011-01-01

γ-Aminobutyric acid type B (GABAB) receptors are important for slow synaptic inhibition in the CNS. The efficacy of inhibition is directly related to the stability of cell surface receptors. For GABAB receptors, heterodimerization between R1 and R2 subunits is critical for cell surface expression and signaling, but how this determines the rate and extent of receptor internalization is unknown. Here, we insert a high affinity α-bungarotoxin binding site into the N terminus of the R2 subunit and reveal its dominant role in regulating the internalization of GABAB receptors in live cells. To simultaneously study R1a and R2 trafficking, a new α-bungarotoxin binding site-labeling technique was used, allowing α-bungarotoxin conjugated to different fluorophores to selectively label R1a and R2 subunits. This approach demonstrated that R1a and R2 are internalized as dimers. In heterologous expression systems and neurons, the rates and extents of internalization for R1aR2 heteromers and R2 homomers are similar, suggesting a regulatory role for R2 in determining cell surface receptor stability. The fast internalization rate of R1a, which has been engineered to exit the endoplasmic reticulum, was slowed to that of R2 by truncating the R1a C-terminal tail or by removing a dileucine motif in its coiled-coil domain. Slowing the rate of internalization by co-assembly with R2 represents a novel role for GPCR heterodimerization whereby R2 subunits, via their C terminus coiled-coil domain, mask a dileucine motif on R1a subunits to determine the surface stability of the GABAB receptor. PMID:21724853

Insilico study of the A(2A)R-D (2)R kinetics and interfacial contact surface for heteromerization.

Science.gov (United States)

Prakash, Amresh; Luthra, Pratibha Mehta

2012-10-01

G-protein-coupled receptors (GPCRs) are cell surface receptors. The dynamic property of receptor-receptor interactions in GPCRs modulates the kinetics of G-protein signaling and stability. In the present work, the structural and dynamic study of A(2A)R-D(2)R interactions was carried to acquire the understanding of the A(2A)R-D(2)R receptor activation and deactivation process, facilitating the design of novel drugs and therapeutic target for Parkinson's disease. The structure-based features (Alpha, Beta, SurfAlpha, and SurfBeta; GapIndex, Leakiness and Gap Volume) and slow mode model (ENM) facilitated the prediction of kinetics (K (off), K (on), and K (d)) of A(2A)R-D(2)R interactions. The results demonstrated the correlation coefficient 0.294 for K (d) and K (on) and the correlation coefficient 0.635 for K (d) and K (off), and indicated stable interfacial contacts in the formation of heterodimer. The coulombic interaction involving the C-terminal tails of the A(2A)R and intracellular loops (ICLs) of D(2)R led to the formation of interfacial contacts between A(2A)R-D(2)R. The properties of structural dynamics, ENM and KFC server-based hot-spot analysis illustrated the stoichiometry of A(2A)R-D(2)R contact interfaces as dimer. The propensity of amino acid residues involved in A(2A)R-D(2)R interaction revealed the presence of positively (R, H and K) and negatively (E and D) charged structural motif of TMs and ICL3 of A(2A)R and D(2)R at interface of dimer contact. Essentially, in silico structural and dynamic study of A(2A)R-D(2)R interactions will provide the basic understanding of the A(2A)R-D(2)R interfacial contact surface for activation and deactivation processes, and could be used as constructive model to recognize the protein-protein interactions in receptor assimilations.

R graphs cookbook

CERN Document Server

Abedin, Jaynal

2014-01-01

Targeted at those with an existing familiarity with R programming, this practical guide will appeal directly to programmers interested in learning effective data visualization techniques with R and a wide-range of its associated libraries.

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.

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.

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 Å].

On the maximum number of cycles in a planar graph

DEFF Research Database (Denmark)

Aldred, R.E.L.; Thomassen, Carsten

2008-01-01

Let G be a graph on p vertices with q edges and let r = q - p + 1. We show that G has at most 15/162(r) cycles. We also show that if G is planar, then G has at most 2(r-1) + o(2(r-1)) cycles. The planar result is best possible in the sense that any prism, that is, the Cartesian product of a cycle...... and a path with one edge, has more than 2(r-1) cycles....

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.

The regulation of ER export and Golgi retention of ST3Gal5 (GM3/GM4 synthase) and B4GalNAcT1 (GM2/GD2/GA2 synthase) by arginine/lysine-based motif adjacent to the transmembrane domain.

Science.gov (United States)

Uemura, Satoshi; Shishido, Fumi; Kashimura, Madoka; Inokuchi, Jin-ichi

2015-12-01

In the Golgi maturation model, the Golgi cisternae dynamically mature along a secretory pathway. In this dynamic process, glycosyltransferases are transported from the endoplasmic reticulum (ER) to the Golgi apparatus where they remain and function. The precise mechanism behind this maturation process remains unclear. We investigated two glycosyltransferases, ST3Gal5 (ST3G5) and B4GalNAcT1 (B4GN1), involved in ganglioside synthesis and examined their signal sequences for ER export and Golgi retention. Reports have suggested that the [R/K](X)[R/K] motif functions as an ER exporting signal; however, this signal sequence is insufficient in stably expressed, full-length ST3G5. Through further analysis, we have clarified that the (2)R(3)R(X)(5) (9)K(X)(3) (13)K sequence in ST3G5 is essential for ER export. We have named the sequence the R/K-based motif. On the other hand, for ER export of B4GN1, the homodimer formation in addition to the R/K-based motif is required for ER export suggesting the importance of unidentified lumenal side interaction. We found that ST3G5 R2A/R3A and K9A/K13A mutants localized not only in Golgi apparatus but also in endosomes. Furthermore, the amounts of mature type asparagine-linked (N)-glycans in ST3G5 R2A/R3A and K9A/K13A mutants were decreased compared with those in wild-type proteins, and the stability of the mutants was lower. These results suggest that the R/K-based motif is necessary for the Golgi retention of ST3G5 and that the retention is involved in the maturation of N-glycans and in stability. Thus, several basic amino acids located on the cytoplasmic tail of ST3G5 play important roles in both ER export and Golgi retention. © The Author 2015. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

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.

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.

Eléments de théorie des graphes

CERN Document Server

Bretto, Alain; Hennecart, François

2012-01-01

Ce livre est une introduction d velopp e la th orie des graphes. Autour de cette th orie se d veloppe aujourd'hui l'un des domaines les plus f conds et les plus dynamiques des mah matiques et de l'informatique. La th orie des graphes permet de r pr senter un ensemble complexe d'objets en exprimant les relations entre les l ments: r seaux de communication, circuits lectriques, etc. Le livre pr sente le langage et les notions l mentaires de cette th orie, les diff rents types de graphes (bipartis, arbres, arborescences, graphes eul riens et hamiltoniens, etc.); il tudie les relations entre les g

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.

An intact PDZ motif is essential for correct P2Y12 purinoceptor traffic in human platelets.

Science.gov (United States)

Nisar, Shaista; Daly, Martina E; Federici, Augusto B; Artoni, Andrea; Mumford, Andrew D; Watson, Stephen P; Mundell, Stuart J

2011-11-17

The platelet P2Y(12) purinoceptor (P2Y(12)R), which plays a crucial role in hemostasis, undergoes internalization and subsequent recycling to maintain receptor responsiveness, processes that are essential for normal platelet function. Here, we observe that P2Y(12)R function is compromised after deletion or mutation of the 4 amino acids at the extreme C-terminus of this receptor (ETPM), a putative postsynaptic density 95/disc large/zonula occludens-1 (PDZ)-binding motif. In cell line models, removal of this sequence or mutation of one of its core residues (P341A), attenuates receptor internalization and receptor recycling back to the membrane, thereby blocking receptor resensitization. The physiologic significance of these findings in the regulation of platelet function is shown by identification of a patient with a heterozygous mutation in the PDZ binding sequence of their P2Y(12)R (P341A) that is associated with reduced expression of the P2Y(12)R on the cell surface. Importantly, platelets from this subject showed significantly compromised P2Y(12)R recycling, emphasizing the importance of the extreme C-terminus of this receptor to ensure correct receptor traffic.

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 Å].

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.

A tandem sequence motif acts as a distance-dependent enhancer in a set of genes involved in translation by binding the proteins NonO and SFPQ

Directory of Open Access Journals (Sweden)

Roepcke Stefan

2011-12-01

Full Text Available Abstract Background Bioinformatic analyses of expression control sequences in promoters of co-expressed or functionally related genes enable the discovery of common regulatory sequence motifs that might be involved in co-ordinated gene expression. By studying promoter sequences of the human ribosomal protein genes we recently identified a novel highly specific Localized Tandem Sequence Motif (LTSM. In this work we sought to identify additional genes and LTSM-binding proteins to elucidate potential regulatory mechanisms. Results Genome-wide analyses allowed finding a considerable number of additional LTSM-positive genes, the products of which are involved in translation, among them, translation initiation and elongation factors, and 5S rRNA. Electromobility shift assays then showed specific signals demonstrating the binding of protein complexes to LTSM in ribosomal protein gene promoters. Pull-down assays with LTSM-containing oligonucleotides and subsequent mass spectrometric analysis identified the related multifunctional nucleotide binding proteins NonO and SFPQ in the binding complex. Functional characterization then revealed that LTSM enhances the transcriptional activity of the promoters in dependency of the distance from the transcription start site. Conclusions Our data demonstrate the power of bioinformatic analyses for the identification of biologically relevant sequence motifs. LTSM and the here found LTSM-binding proteins NonO and SFPQ were discovered through a synergistic combination of bioinformatic and biochemical methods and are regulators of the expression of a set of genes of the translational apparatus in a distance-dependent manner.

Quantum graphs with the Bethe-Sommerfeld property

Czech Academy of Sciences Publication Activity Database

Exner, Pavel; Turek, Ondřej

2017-01-01

Roč. 8, č. 3 (2017), s. 305-309 ISSN 2220-8054 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : periodic quantum graphs * gap number * delta-coupling * rectangular lattice graph * scale-invariant coupling * Bethe-Sommerfeld conjecture * golden mean Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics ( physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect)

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

On The Determinant of q-Distance Matrix of a Graph

Directory of Open Access Journals (Sweden)

Li Hong-Hai

2014-02-01

Full Text Available In this note, we show how the determinant of the q-distance matrix Dq(T of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph G by adding the weighted branches to G, and so generalize in part the results obtained by Bapat et al. [R.B. Bapat, S. Kirkland and M. Neumann, On distance matrices and Laplacians, Linear Algebra Appl. 401 (2005 193- 209]. In particular, as a consequence, determinantal formulae of q-distance matrices for unicyclic graphs and one class of bicyclic graphs are presented.

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.

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.

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.

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

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.

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.

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...

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

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

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

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

2-[(1R*,4R*-1,4-Dihydroxycyclohexyl]acetic acid

Directory of Open Access Journals (Sweden)

Mohammad Arfan

2011-04-01

Full Text Available The title compound, C8H14O4, is an isolation product of the aerial parts of Senecio desfontanei. The acetic acid group is oriented at a dihedral angle of 48.03 (9° with respect to the basal plane of the cyclohexane-1,4-diol chair. An intramolecular O—H...O hydrogen bond generates an S(6 ring with an envelope conformation. In the crystal, molecules are linked by O—H...O hydrogen bonds, resulting in R33(20 ring motifs and C(2 O—H...O—H...O—H... chains. Overall, a three-dimensional polymeric network arises. A C—H...O contact is also present.

Induction of cell death by tospoviral protein NSs and the motif critical for cell death does not control RNA silencing suppression activity.

Science.gov (United States)

Singh, Ajeet; Permar, Vipin; Jain, R K; Goswami, Suneha; Kumar, Ranjeet Ranjan; Canto, Tomas; Palukaitis, Peter; Praveen, Shelly

2017-08-01

Groundnut bud necrosis virus induces necrotic symptoms in different hosts. Previous studies showed reactive oxygen species-mediated programmed cell death (PCD) resulted in necrotic symptoms. Transgenic expression of viral protein NSs mimics viral symptoms. Here, we showed a role for NSs in influencing oxidative burst in the cell, by analyzing H 2 O 2 accumulation, activities of antioxidant enzymes and expression levels of vacuolar processing enzymes, H 2 O 2 -responsive microRNA 319a.2 plus its possible target metacaspase-8. The role of NSs in PCD, was shown using two NSs mutants: one in the Trp/GH3 motif (a homologue of pro-apototic domain) (NSs S189R ) and the other in a non-Trp/GH3 motif (NSs L172R ). Tobacco rattle virus (TRV) expressing NSs S189R enhanced the PCD response, but not TRV-NSs L172R , while RNA silencing suppression activity was lost in TRV-NSs L172R , but not in TRV-NSs S189R . Therefore, we propose dual roles of NSs in RNA silencing suppression and induction of cell death, controlled by different motifs. Copyright © 2017 Elsevier Inc. All rights reserved.

Robustness and backbone motif of a cancer network regulated by miR-17-92 cluster during the G1/S transition.

Directory of Open Access Journals (Sweden)

Lijian Yang

Full Text Available Based on interactions among transcription factors, oncogenes, tumor suppressors and microRNAs, a Boolean model of cancer network regulated by miR-17-92 cluster is constructed, and the network is associated with the control of G1/S transition in the mammalian cell cycle. The robustness properties of this regulatory network are investigated by virtue of the Boolean network theory. It is found that, during G1/S transition in the cell cycle process, the regulatory networks are robustly constructed, and the robustness property is largely preserved with respect to small perturbations to the network. By using the unique process-based approach, the structure of this network is analyzed. It is shown that the network can be decomposed into a backbone motif which provides the main biological functions, and a remaining motif which makes the regulatory system more stable. The critical role of miR-17-92 in suppressing the G1/S cell cycle checkpoint and increasing the uncontrolled proliferation of the cancer cells by targeting a genetic network of interacting proteins is displayed with our model.

On revealing graph cycles via boundary measurements

International Nuclear Information System (INIS)

Belishev, M I; Wada, N

2009-01-01

This paper deals with boundary value inverse problems on a metric graph, the structure of the graph being assumed unknown. The question under consideration is how to detect from the dynamical and/or spectral inverse data whether the graph contains cycles (is not a tree). For any graph Ω, the dynamical as well as spectral boundary inverse data determine the so-called wave diameter d w : H -1 (Ω) → R defined on functionals supported in the graph. The known fact is that if Ω is a tree then d w ≥ 0 holds and, in this case, the inverse data determine Ω up to isometry. A graph Ω is said to be coordinate if the functions {dist Ω (., γ)} γin∂Ω constitute a coordinate system on Ω. For such graphs, we propose a procedure, which reveals the presence/absence of cycles. The hypothesis is that Ω contains cycles if and only if d w takes negative values. We do not justify this hypothesis in the general case but reduce it to a certain special class of graphs (suns)

R2E – identifying problems, mitigating risks

CERN Document Server

Anaïs Schaeffer

2013-01-01

During LS1, the R2E project team will be working on a task as painstaking as it is crucial: to achieve a sixfold reduction in the number of electronic malfunctions caused by radiation. On their success depends the ability of the accelerator to function correctly at nominal energy. No mean challenge, considering it comes on top of the tenfold reduction already achieved since 2009.   The graph plots the rate of LHC beam dumps due to single-event effects against beam luminosity. An indication of the challenge that faces the R2E project teams during LS1! The origins of the project known as R2E (Radiation to Electronics) go back to 2007, when the CNGS (CERN Neutrinos to Gran Sasso) experiment was being commissioned. "Right from the outset, some CNGS control systems were causing problems. They would regularly break down in operations with beam," recalls Markus Brugger, head of the R2E project. "Even though the beam intensity was very low, we began to suspect that radiati...

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.

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.

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) ...

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.

Geometric covers, graph orientations, counter games

DEFF Research Database (Denmark)

Berglin, Edvin

-directed graph is dynamic (can be altered by some outside actor), some orientations may need to be reversed in order to maintain the low out-degree. We present a new algorithm that is simpler than earlier work, yet matches or outperforms the efficiency of these results with very few exceptions. Counter games...... example is Line Cover, also known as Point-Line Cover, where a set of points in a geometric space are to be covered by placing a restricted number of lines. We present new FPT algorithms for the sub-family Curve Cover (which includes Line Cover), as well as for Hyperplane Cover restricted to R 3 (i...... are a type of abstract game played over a set of counters holding values, and these values may be moved between counters according to some set of rules. Typically they are played between two players: the adversary who tries to concentrate the greatest value possible in a single counter, and the benevolent...

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\

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.

1 / n Expansion for the Number of Matchings on Regular Graphs and Monomer-Dimer Entropy

Science.gov (United States)

Pernici, Mario

2017-08-01

Using a 1 / n expansion, that is an expansion in descending powers of n, for the number of matchings in regular graphs with 2 n vertices, we study the monomer-dimer entropy for two classes of graphs. We study the difference between the extensive monomer-dimer entropy of a random r-regular graph G (bipartite or not) with 2 n vertices and the average extensive entropy of r-regular graphs with 2 n vertices, in the limit n → ∞. We find a series expansion for it in the numbers of cycles; with probability 1 it converges for dimer density p diverges as |ln(1-p)| for p → 1. In the case of regular lattices, we similarly expand the difference between the specific monomer-dimer entropy on a lattice and the one on the Bethe lattice; we write down its Taylor expansion in powers of p through the order 10, expressed in terms of the number of totally reducible walks which are not tree-like. We prove through order 6 that its expansion coefficients in powers of p are non-negative.

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...

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.)

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 Study on the Amount of Random Graph Groupies

OpenAIRE

Lu, Daodi

2013-01-01

In 1980, Ajtai, Komlos and Szemer{\\'e}di defined "groupie": Let $G=(V,E)$ be a simple graph, $|V|=n$, $|E|=e$. For a vertex $v\\in V$, let $r(v)$ denote the sum of the degrees of the vertices adjacent to $v$. We say $v\\in V$ is a {\\it groupie}, if $\\frac{r(v)}{\\deg(v)}\\geq\\frac{e}{n}.$ In this paper, we prove that in random graph $B(n,p)$, $0

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.

Subgraphs in vertex neighborhoods of K-free graphs

DEFF Research Database (Denmark)

Bang-Jensen, J.; Brandt, Stephan

2004-01-01

In a K-free graph, the neighborhood of every vertex induces a K-free subgraph. The K-free graphs with the converse property that every induced K-free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r = 3 due to Pach [8]....

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.

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)

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

Relating 2-Rainbow Domination To Roman Domination

Directory of Open Access Journals (Sweden)

Alvarado José D.

2017-11-01

Full Text Available For a graph G, let R(G and yr2(G denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G ≤ R(G ≤ 3/2yr2(G. Fujita and Furuya [Difference between 2-rainbow domination and Roman domination in graphs, Discrete Appl. Math. 161 (2013 806-812] present some kind of characterization of the graphs G for which R(G − yr2(G = k for some integer k. Unfortunately, their result does not lead to an algorithm that allows to recognize these graphs efficiently. We show that for every fixed non-negative integer k, the recognition of the connected K4-free graphs G with yR(G − yr2(G = k is NP-hard, which implies that there is most likely no good characterization of these graphs. We characterize the graphs G such that yr2(H = yR(H for every induced subgraph H of G, and collect several properties of the graphs G with R(G = 3/2yr2(G.

Relative binding affinity prediction of farnesoid X receptor in the D3R Grand Challenge 2 using FEP+

Science.gov (United States)

Schindler, Christina; Rippmann, Friedrich; Kuhn, Daniel

2018-01-01

Physics-based free energy simulations have increasingly become an important tool for predicting binding affinity and the recent introduction of automated protocols has also paved the way towards a more widespread use in the pharmaceutical industry. The D3R 2016 Grand Challenge 2 provided an opportunity to blindly test the commercial free energy calculation protocol FEP+ and assess its performance relative to other affinity prediction methods. The present D3R free energy prediction challenge was built around two experimental data sets involving inhibitors of farnesoid X receptor (FXR) which is a promising anticancer drug target. The FXR binding site is predominantly hydrophobic with few conserved interaction motifs and strong induced fit effects making it a challenging target for molecular modeling and drug design. For both data sets, we achieved reasonable prediction accuracy (RMSD ≈ 1.4 kcal/mol, rank 3-4 according to RMSD out of 20 submissions) comparable to that of state-of-the-art methods in the field. Our D3R results boosted our confidence in the method and strengthen our desire to expand its applications in future in-house drug design projects.

Relative binding affinity prediction of farnesoid X receptor in the D3R Grand Challenge 2 using FEP.

Science.gov (United States)

Schindler, Christina; Rippmann, Friedrich; Kuhn, Daniel

2018-01-01

Physics-based free energy simulations have increasingly become an important tool for predicting binding affinity and the recent introduction of automated protocols has also paved the way towards a more widespread use in the pharmaceutical industry. The D3R 2016 Grand Challenge 2 provided an opportunity to blindly test the commercial free energy calculation protocol FEP+ and assess its performance relative to other affinity prediction methods. The present D3R free energy prediction challenge was built around two experimental data sets involving inhibitors of farnesoid X receptor (FXR) which is a promising anticancer drug target. The FXR binding site is predominantly hydrophobic with few conserved interaction motifs and strong induced fit effects making it a challenging target for molecular modeling and drug design. For both data sets, we achieved reasonable prediction accuracy (RMSD ≈ 1.4 kcal/mol, rank 3-4 according to RMSD out of 20 submissions) comparable to that of state-of-the-art methods in the field. Our D3R results boosted our confidence in the method and strengthen our desire to expand its applications in future in-house drug design projects.

STABILITY OF LINEAR MULTIAGENT SCALAR SYSTEMS AND ITS DEPENDENCE ON CONNECTIVITY GRAPH

Directory of Open Access Journals (Sweden)

S. I. Tomashevich

2014-03-01

Full Text Available Multiagent systems are now finding increasingly wide applications in various engineering fields such as energy, transportation, robotics, aviation and others. There are two main aspects to be focused on when organizing multiagent systems: the dynamics of the agents themselves and the ways of their interaction. This interaction is determined by the structure of information connections between agents. Thus, there are several key points of multiagent systems study: the dynamics of individual agents and shape of the information graph. Formation dynamics, in general, is determined by a set of properties of agents and connectivity graph. The paper deals with the relationship between dynamics of agents and Laplace matrix, which is used to set the graph connections. The present research is based on the results given in the known paper by A. Fax and R. Murray (IEEE Trans. AC, 2004. An illustrative example is given, and the application problem of studying the formation dynamics consisting of the group of quadrocopters is presented. Information exchange between agents is determined in the paper by means of the conventional set of graphs. The paper presents an interpretation of the stability conditions and the method of system performance improvement based on these conditions. Motion of quadrocopters group along the flight height is used as an example for methodology application. The simulation results demonstrate the basic dependencies between the information graph shape (and, consequently, the eigenvalues of the Laplacian, which describes this graph and formation stability. Simulation and consideration of Nyquist diagram connection with the key points give an indication of the system stability and take steps to change the control laws. Necessary conditions for the formation stability are obtained on the basis of this research method. Research result makes it possible to create local control laws for agents to ensure the stability of motion in the selected

On the Distribution of Random Geometric Graphs

DEFF Research Database (Denmark)

Badiu, Mihai Alin; Coon, Justin P.

2018-01-01

as a measure of the graph’s topological uncertainty (or information content). Moreover, the distribution is also relevant for determining average network performance or designing protocols. However, a major impediment in deducing the graph distribution is that it requires the joint probability distribution......Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random topology, properties (e.g., connectedness), or Shannon entropy...... of the n(n − 1)/2 distances between n nodes randomly distributed in a bounded domain. As no such result exists in the literature, we make progress by obtaining the joint distribution of the distances between three nodes confined in a disk in R 2. This enables the calculation of the probability distribution...

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.

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)

Genome-wide organization and expression profiling of the R2R3-MYB transcription factor family in pineapple (Ananas comosus).

Science.gov (United States)

Liu, Chaoyang; Xie, Tao; Chen, Chenjie; Luan, Aiping; Long, Jianmei; Li, Chuhao; Ding, Yaqi; He, Yehua

2017-07-01

The MYB proteins comprise one of the largest families of plant transcription factors, which are involved in various plant physiological and biochemical processes. Pineapple (Ananas comosus) is one of three most important tropical fruits worldwide. The completion of pineapple genome sequencing provides a great opportunity to investigate the organization and evolutionary traits of pineapple MYB genes at the genome-wide level. In the present study, a total of 94 pineapple R2R3-MYB genes were identified and further phylogenetically classified into 26 subfamilies, as supported by the conserved gene structures and motif composition. Collinearity analysis indicated that the segmental duplication events played a crucial role in the expansion of pineapple MYB gene family. Further comparative phylogenetic analysis suggested that there have been functional divergences of MYB gene family during plant evolution. RNA-seq data from different tissues and developmental stages revealed distinct temporal and spatial expression profiles of the AcMYB genes. Further quantitative expression analysis showed the specific expression patterns of the selected putative stress-related AcMYB genes in response to distinct abiotic stress and hormonal treatments. The comprehensive expression analysis of the pineapple MYB genes, especially the tissue-preferential and stress-responsive genes, could provide valuable clues for further function characterization. In this work, we systematically identified AcMYB genes by analyzing the pineapple genome sequence using a set of bioinformatics approaches. Our findings provide a global insight into the organization, phylogeny and expression patterns of the pineapple R2R3-MYB genes, and hence contribute to the greater understanding of their biological roles in pineapple.

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.

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.

Genome-wide identification, functional prediction, and evolutionary analysis of the R2R3-MYB superfamily in Brassica napus.

Science.gov (United States)

Hajiebrahimi, Ali; Owji, Hajar; Hemmati, Shiva

2017-10-01

R2R3-MYB transcription factors (TFs) have been shown to play important roles in plants, including in development and in various stress conditions. Phylogenetic analysis showed the presence of 249 R2R3-MYB TFs in Brassica napus, called BnaR2R3-MYB TFs, clustered into 38 clades. BnaR2R3-MYB TFs were distributed on 19 chromosomes of B. napus. Sixteen gene clusters were identified. BnaR2R3-MYB TFs were characterized by motif prediction, gene structure analysis, and gene ontology. Evolutionary analysis revealed that BnaR2R3-MYB TFs are mainly formed as a result of whole-genome duplication. Orthologs and paralogs of BnaR2R3-MYB TFs were identified in B. napus, B. rapa, B. oleracea, and Arabidopsis thaliana using synteny-based methods. Purifying selection was pervasive within R2R3-MYB TFs. K n /K s values lower than 0.3 indicated that BnaR2R3-MYB TFs are being functionally converged. The role of gene conversion in the formation of BnaR2R3-MYB TFs was significant. Cis-regulatory elements in the upstream regions of BnaR2R3-MYB genes, miRNA targeting BnaR2R3MYB TFs, and post translational modifications were identified. Digital expression data revealed that BnaR2R3-MYB genes were highly expressed in the roots and under high salinity treatment after 24 h. BnaMYB21, BnaMYB141, and BnaMYB148 have been suggested for improving salt-tolerant B. napus. BnaR2R3-MYB genes were mostly up regulated on the 14th day post inoculation with Leptosphaeria biglobosa and L. maculan. BnaMYB150 is a candidate for increased tolerance to Leptospheria in B. napus.

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.

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).

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.

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.

Genome-Wide Identification of R2R3-MYB Genes and Expression Analyses During Abiotic Stress in Gossypium raimondii

Science.gov (United States)

He, Qiuling; Jones, Don C.; Li, Wei; Xie, Fuliang; Ma, Jun; Sun, Runrun; Wang, Qinglian; Zhu, Shuijin; Zhang, Baohong

2016-01-01

The R2R3-MYB is one of the largest families of transcription factors, which have been implicated in multiple biological processes. There is great diversity in the number of R2R3-MYB genes in different plants. However, there is no report on genome-wide characterization of this gene family in cotton. In the present study, a total of 205 putative R2R3-MYB genes were identified in cotton D genome (Gossypium raimondii), that are much larger than that found in other cash crops with fully sequenced genomes. These GrMYBs were classified into 13 groups with the R2R3-MYB genes from Arabidopsis and rice. The amino acid motifs and phylogenetic tree were predicted and analyzed. The sequences of GrMYBs were distributed across 13 chromosomes at various densities. The results showed that the expansion of the G. Raimondii R2R3-MYB family was mainly attributable to whole genome duplication and segmental duplication. Moreover, the expression pattern of 52 selected GrMYBs and 46 GaMYBs were tested in roots and leaves under different abiotic stress conditions. The results revealed that the MYB genes in cotton were differentially expressed under salt and drought stress treatment. Our results will be useful for determining the precise role of the MYB genes during stress responses with crop improvement. PMID:27009386

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.

Karyological characterization and identification of four repetitive element groups (the 18S – 28S rRNA gene, telomeric sequences, microsatellite repeat motifs, Rex retroelements) of the Asian swamp eel (Monopterus albus)

Science.gov (United States)

Suntronpong, Aorarat; Thapana, Watcharaporn; Twilprawat, Panupon; Prakhongcheep, Ornjira; Somyong, Suthasinee; Muangmai, Narongrit; Surin Peyachoknagul; Srikulnath, Kornsorn

2017-01-01

Abstract Among teleost fishes, Asian swamp eel (Monopterus albus Zuiew, 1793) possesses the lowest chromosome number, 2n = 24. To characterize the chromosome constitution and investigate the genome organization of repetitive sequences in M. albus, karyotyping and chromosome mapping were performed with the 18S – 28S rRNA gene, telomeric repeats, microsatellite repeat motifs, and Rex retroelements. The 18S – 28S rRNA genes were observed to the pericentromeric region of chromosome 4 at the same position with large propidium iodide and C-positive bands, suggesting that the molecular structure of the pericentromeric regions of chromosome 4 has evolved in a concerted manner with amplification of the 18S – 28S rRNA genes. (TTAGGG)n sequences were found at the telomeric ends of all chromosomes. Eight of 19 microsatellite repeat motifs were dispersedly mapped on different chromosomes suggesting the independent amplification of microsatellite repeat motifs in M. albus. Monopterus albus Rex1 (MALRex1) was observed at interstitial sites of all chromosomes and in the pericentromeric regions of most chromosomes whereas MALRex3 was scattered and localized to all chromosomes and MALRex6 to several chromosomes. This suggests that these retroelements were independently amplified or lost in M. albus. Among MALRexs (MALRex1, MALRex3, and MALRex6), MALRex6 showed higher interspecific sequence divergences from other teleost species in comparison. This suggests that the divergence of Rex6 sequences of M. albus might have occurred a relatively long time ago. PMID:29093797

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.

Evolutionary Graphs with Frequency Dependent Fitness

Science.gov (United States)

Nie, Pu-Yan; Zhang, Pei-Ai

Evolutionary graph theory was recently proposed by Lieberman et al. in 2005. In the previous papers about evolutionary graphs (EGs), the fitness of the residents in the EGs is in general assumed to be unity, and the fitness of a mutant is assumed to be a constant r. We aim to extend EG to general cases in this paper, namely, the fitness of a mutant is heavily dependent upon frequency. The corresponding properties for these new EGs are analyzed, and the fixation probability is obtained for large population.

Solving the scalability issue in quantum-based refinement: Q|R#1.

Science.gov (United States)

Zheng, Min; Moriarty, Nigel W; Xu, Yanting; Reimers, Jeffrey R; Afonine, Pavel V; Waller, Mark P

2017-12-01

Accurately refining biomacromolecules using a quantum-chemical method is challenging because the cost of a quantum-chemical calculation scales approximately as n m , where n is the number of atoms and m (≥3) is based on the quantum method of choice. This fundamental problem means that quantum-chemical calculations become intractable when the size of the system requires more computational resources than are available. In the development of the software package called Q|R, this issue is referred to as Q|R#1. A divide-and-conquer approach has been developed that fragments the atomic model into small manageable pieces in order to solve Q|R#1. Firstly, the atomic model of a crystal structure is analyzed to detect noncovalent interactions between residues, and the results of the analysis are represented as an interaction graph. Secondly, a graph-clustering algorithm is used to partition the interaction graph into a set of clusters in such a way as to minimize disruption to the noncovalent interaction network. Thirdly, the environment surrounding each individual cluster is analyzed and any residue that is interacting with a particular cluster is assigned to the buffer region of that particular cluster. A fragment is defined as a cluster plus its buffer region. The gradients for all atoms from each of the fragments are computed, and only the gradients from each cluster are combined to create the total gradients. A quantum-based refinement is carried out using the total gradients as chemical restraints. In order to validate this interaction graph-based fragmentation approach in Q|R, the entire atomic model of an amyloid cross-β spine crystal structure (PDB entry 2oNA) was refined.

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.

Nodal domains on isospectral quantum graphs: the resolution of isospectrality?

International Nuclear Information System (INIS)

Band, Ram; Shapira, Talia; Smilansky, Uzy

2006-01-01

We present and discuss isospectral quantum graphs which are not isometric. These graphs are the analogues of the isospectral domains in R 2 which were introduced recently in Gordon et al (1992 Bull. Am. Math. Soc. 27 134-8), Chapman (1995 Am. Math. Mon. 102 124), Buser et al (1994 Int. Math. Res. Not. 9 391-400), Okada and Shudo (2001 J. Phys. A: Math. Gen. 34 5911-22), Jakobson et al (2006 J. Comput. Appl. Math. 194 141-55) and Levitin et al (2006 J. Phys. A: Math. Gen. 39 2073-82)) all based on Sunada's construction of isospectral domains (Sunada T 1985 Ann. Math. 121 196-86). After presenting some of the properties of these graphs, we discuss a few examples which support the conjecture that by counting the nodal domains of the corresponding eigenfunctions one can resolve the isospectral ambiguity

Perfect state transfer in unitary Cayley graphs over local rings

Directory of Open Access Journals (Sweden)

Yotsanan Meemark

2014-12-01

Full Text Available In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph. Moreover, we have some developments when $R$ is a product of local rings.

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.

Isoperimetric inequalities for minimal graphs

International Nuclear Information System (INIS)

Pacelli Bessa, G.; Montenegro, J.F.

2007-09-01

Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)

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....

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.

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

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...

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

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