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

Supra-molecular hydrogen-bonding patterns in the N(9)-H protonated and N(7)-H tautomeric form of an N(6) -benzoyl-adenine salt: N (6)-benzoyl-adeninium nitrate.

Science.gov (United States)

Karthikeyan, Ammasai; Jeeva Jasmine, Nithianantham; Thomas Muthiah, Packianathan; Perdih, Franc

2016-02-01

In the title molecular salt, C12H10N5O(+)·NO3 (-), the adenine unit has an N (9)-protonated N(7)-H tautomeric form with non-protonated N(1) and N(3) atoms. The dihedral angle between the adenine ring system and the phenyl ring is 51.10 (10)°. The typical intra-molecular N(7)-H⋯O hydrogen bond with an S(7) graph-set motif is also present. The benzoyl-adeninium cations also form base pairs through N-H⋯O and C-H⋯N hydrogen bonds involving the Watson-Crick face of the adenine ring and the C and O atoms of the benzoyl ring of an adjacent cation, forming a supra-molecular ribbon with R 2 (2)(9) rings. Benzoyl-adeninum cations are also bridged by one of the oxygen atoms of the nitrate anion, which acts as a double acceptor, forming a pair of N-H⋯O hydrogen bonds to generate a second ribbon motif. These ribbons together with π-π stacking inter-actions between the phenyl ring and the five- and six-membered adenine rings of adjacent mol-ecules generate a three-dimensional supra-molecular architecture.

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

Application of Bipolar Fuzzy Sets in Graph Structures

Directory of Open Access Journals (Sweden)

Muhammad Akram

2016-01-01

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

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

Science.gov (United States)

Gade, Chandrasekhar Reddy; Sharma, Nagendra K

2017-12-15

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

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

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.

SurR9C84A protects and recovers human cardiomyocytes from hypoxia induced apoptosis

Energy Technology Data Exchange (ETDEWEB)

Ashok, Ajay [Nanomedicine-Laboratory of Immunology and Molecular Biomedical Research (NLIMBR), School of Medicine (SoM), Faculty of Health, Centre for Molecular and Medical Research - C-MMR, Deakin University, Waurn Ponds, Victoria 3216 (Australia); Department of Pathology, Case Western Reserve University, 2103 Cornell Rd. WRB 5128, Cleveland, OH 44106-7288 (United States); Kanwar, Jagat Rakesh [Nanomedicine-Laboratory of Immunology and Molecular Biomedical Research (NLIMBR), School of Medicine (SoM), Faculty of Health, Centre for Molecular and Medical Research - C-MMR, Deakin University, Waurn Ponds, Victoria 3216 (Australia); Krishnan, Uma Maheswari [Centre for Nanotechnology & Advanced Biomaterials (CeNTAB), School of Chemical & Biotechnology (SCBT), SASTRA University, Thanjavur 613401 (India); Kanwar, Rupinder Kaur, E-mail: rupinder.kanwar@deakin.edu.au [Nanomedicine-Laboratory of Immunology and Molecular Biomedical Research (NLIMBR), School of Medicine (SoM), Faculty of Health, Centre for Molecular and Medical Research - C-MMR, Deakin University, Waurn Ponds, Victoria 3216 (Australia)

2017-01-01

Survivin, as an anti-apoptotic protein and a cell cycle regulator, is recently gaining importance for its regenerative potential in salvaging injured hypoxic cells of vital organs such as heart. Different strategies are being employed to upregulate survivin expression in dying hypoxic cardiomyocytes. We investigated the cardioprotective potential of a cell permeable survivin mutant protein SurR9C84A, for the management of hypoxia mediated cardiomyocyte apoptosis, in a novel and clinically relevant model employing primary human cardiomyocytes (HCM). The aim of this research work was to study the efficacy and mechanism of SurR9C84A facilitated cardioprotection and regeneration in hypoxic HCM. To mimic hypoxic microenvironment in vitro, well characterized HCM were treated with 100 µm (48 h) cobalt chloride to induce hypoxia. Hypoxia induced (HI) HCM were further treated with SurR9C84A (1 µg/mL) in order to analyse its cardioprotective efficacy. Confocal microscopy showed rapid internalization of SurR9C84A and scanning electron microscopy revealed the reinstatement of cytoskeleton projections in HI HCM. SurR9C84A treatment increased cell viability, reduced cell death via, apoptosis (Annexin-V assay), and downregulated free cardiac troponin T and MMP-9 expression. SurR9C84A also upregulated the expression of proliferation markers (PCNA and Ki-67) and downregulated mitochondrial depolarization and ROS levels thereby, impeding cell death. Human Apoptosis Array further revealed that SurR9C84A downregulated expression of pro-apoptotic markers and augmented expression of HSPs and HTRA2/Omi. SurR9C84A treatment led to enhanced levels of survivin, VEGF, PI3K and pAkt. SurR9C84A proved non-toxic to normoxic HCM, as validated through unaltered cell proliferation and other marker levels. Its pre-treatment exhibited lesser susceptibility to hypoxia/damage. SurR9C84A holds a promising clinical potential for human cardiomyocyte survival and proliferation following hypoxic injury

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

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

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.

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

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.

海马神经元中TAT-GluR6-9c-dansyl小肽的荧光观察%Delivery of GluR6-9c into hippocampal neurons by TAT transduction domain

Institute of Scientific and Technical Information of China (English)

纵艳艳; 裴冬生; 孙亚峰; 张光毅

2005-01-01

目的研究TAT-GluR6-9c-dansyl荧光小肽是否可以进入细胞内部.方法在培养的海马神经元中加入TAT-GluR6-9c-dansyl荧光小肽和对照肽TAT38-48-dansyl.结果用10 μmol/L TAT-GluR6-9c-dansyl处理的海马神经元在荧光显微镜下可以观到绿色荧光的出现,而对照肽TAT38-48-dansyl无荧光出现.结论 TAT-GluR6-9c-dansyl荧光小肽可以进入细胞.

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.

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)

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.

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.

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.

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.

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

Distributed Large Independent Sets in One Round On Bounded-independence Graphs

OpenAIRE

Halldorsson , Magnus M.; Konrad , Christian

2015-01-01

International audience; We present a randomized one-round, single-bit messages, distributed algorithm for the maximum independent set problem in polynomially bounded-independence graphs with poly-logarithmic approximation factor. Bounded-independence graphs capture various models of wireless networks such as the unit disc graphs model and the quasi unit disc graphs model. For instance, on unit disc graphs, our achieved approximation ratio is O((log(n)/log(log(n)))^2).A starting point of our w...

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.

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.

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

3-biplacement of bipartite graphs

Directory of Open Access Journals (Sweden)

Lech Adamus

2008-01-01

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

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

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

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.

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.

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

Science.gov (United States)

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

2013-02-15

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

Trimethyl 3,3′,3′′-(benzene-1,3,5-triyltripropynoate

Directory of Open Access Journals (Sweden)

Felix Katzsch

2016-04-01

Full Text Available In the title compound, C18H12O6, the alkyne bonds are distorted, featuring bond angles around the C—C[triple-bond]C—C group of 173.6 (1/179.0 (1, 178.1 (1/178.4 (1 and 174.9 (1/175.9 (1°, and the ester groups make angles of 3.5 (1, 13.8 (1 and 14.5 (1° with the central benzene ring. In the crystal, molecules are connected in layers parallel to (131 by weak C—H...O hydrogen bonds, giving rise to a system of hydrogen-bonded ring motifs with graph sets R22(14 and R44(22. The layers are linked by C—H...O and C—H...π contacts.

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

Science.gov (United States)

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

2013-01-01

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

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

OpenAIRE

Muhammad, Akram; Musavarah, Sarwar

2016-01-01

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

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

DEFF Research Database (Denmark)

Erleben, Kenny

2009-01-01

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

Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

NARCIS (Netherlands)

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

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

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

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.

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 \

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.

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

Complete cDNA sequence of human complement C1s and close physical linkage of the homologous genes C1s and C1r

International Nuclear Information System (INIS)

Tosi, M.; Duponchel, C.; Meo, T.; Julier, C.

1987-01-01

Overlapping molecular clones encoding the complement subcomponent C1s were isolated from a human liver cDNA library. The nucleotide sequence reconstructed from these clones spans about 85% of the length of the liver C1s messenger RNAs, which occur in three distinct size classes around 3 kilobases in length. Comparisons with the sequence of C1r, the other enzymatic subcomponent of C1, reveal 40% amino acid identity and conservation of all the cysteine residues. Beside the serine protease domain, the following sequence motifs, previously described in C1r, were also found in C1s: (a) two repeats of the type found in the Ba fragment of complement factor B and in several other complement but also noncomplement proteins, (b) a cysteine-rich segment homologous to the repeats of epidermal growth factor precursor, and (c) a duplicated segment found only in C1r and C1s. Differences in each of these structural motifs provide significant clues for the interpretation of the functional divergence of these interacting serine protease zymogens. Hybridizations of C1r and C1s probes to restriction endonuclease fragments of genomic DNA demonstrate close physical linkage of the corresponding genes. The implications of this finding are discussed with respect to the evolution of C1r and C1s after their origin by tandem gene duplication and to the previously observed combined hereditary deficiencies of Clr and Cls

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

On Graph C*-Algebras with a Linear Ideal Lattice

DEFF Research Database (Denmark)

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

2010-01-01

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

Every plane graph of maximum degree 8 has an edge-face 9-colouring.

NARCIS (Netherlands)

R.J. Kang (Ross); J.-S. Sereni; M. Stehlík

2011-01-01

textabstractAn edge-face coloring of a plane graph with edge set $E$ and face set $F$ is a coloring of the elements of $E\\cup F$ such that adjacent or incident elements receive different colors. Borodin proved that every plane graph of maximum degree $\\Delta \\ge 10$ can be edge-face colored with

CompariMotif: quick and easy comparisons of sequence motifs.

Science.gov (United States)

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

2008-05-15

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

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

OpenAIRE

Boersema, Jeffrey L.

2014-01-01

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

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

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

Directory of Open Access Journals (Sweden)

N.S.A. Karim

2016-04-01

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

C V R Murty

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education. C V R Murty. Articles written in Resonance – Journal of Science Education. Volume 9 Issue 8 August 2004 pp 75-78 Classroom. Learning Earthquake Design and Construction – 1. What causes Earthquakes? C V R Murty · More Details Fulltext PDF. Volume 9 ...

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.

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.

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.

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.

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

A General Approximation of Quantum Graph Vertex Couplings by Scaled Schrodinger Operators on Thin Branched Manifolds

Czech Academy of Sciences Publication Activity Database

Exner, Pavel; Post, O.

2013-01-01

Roč. 322, č. 1 (2013), s. 207-227 ISSN 0010-3616 R&D Projects: GA ČR GAP203/11/0701; GA MŠk LC06002 Institutional support: RVO:61389005 Keywords : quantum graph * vertex coupling * tubular network * approximation Subject RIV: BE - Theoretical Physics Impact factor: 1.901, year: 2013 http://download.springer.com/static/pdf/685/art%253A10.1007%252Fs00220-013-1699-9.pdf?auth66=1379859821_26f2df9c1c7e0997b290a90ec2fdfc7e&ext=.pdf

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

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…

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

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.

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

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

Science.gov (United States)

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

2017-10-27

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

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

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

Science.gov (United States)

Sunohara, Masataka; Sato, Iwao; Morikawa, Shigeru

2017-11-30

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

C7-Decompositions of the Tensor Product of Complete Graphs

Directory of Open Access Journals (Sweden)

Manikandan R.S.

2017-08-01

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

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

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.

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

Establishment of mouse model of MYH9 disorders: heterozygous R702C mutation provokes macrothrombocytopenia with leukocyte inclusion bodies, renal glomerulosclerosis and hearing disability.

Science.gov (United States)

Suzuki, Nobuaki; Kunishima, Shinji; Ikejiri, Makoto; Maruyama, Shoichi; Sone, Michihiko; Takagi, Akira; Ikawa, Masahito; Okabe, Masaru; Kojima, Tetsuhito; Saito, Hidehiko; Naoe, Tomoki; Matsushita, Tadashi

2013-01-01

Nonmuscle myosin heavy chain IIA (NMMHCIIA) encoded by MYH9 is associated with autosomal dominantly inherited diseases called MYH9 disorders. MYH9 disorders are characterized by macrothrombocytopenia and very characteristic inclusion bodies in granulocytes. MYH9 disorders frequently cause nephritis, sensorineural hearing disability and cataracts. One of the most common and deleterious mutations causing these disorders is the R702C missense mutation. We generated knock-in mice expressing the Myh9 R702C mutation. R702C knock-in hetero mice (R702C+/- mice) showed macrothrombocytopenia. We studied megakaryopoiesis of cultured fetal liver cells of R702C+/- mice and found that proplatelet formation was impaired: the number of proplatelet tips was decreased, proplatelet size was increased, and proplatelet shafts were short and enlarged. Although granulocyte inclusion bodies were not visible by May-Grünwald Giemsa staining, immunofluorescence analysis indicated that NMMHCIIA proteins aggregated and accumulated in the granulocyte cytoplasm. In other organs, R702C+/- mice displayed albuminuria which increased with age. Renal pathology examination revealed glomerulosclerosis. Sensory hearing loss was indicated by lowered auditory brainstem response. These findings indicate that Myh9 R702C knock-in mice mirror features of human MYH9 disorders arising from the R702C mutation.

Destroying longest cycles in graphs and digraphs

DEFF Research Database (Denmark)

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

2015-01-01

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

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.

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

Directory of Open Access Journals (Sweden)

Cutler Sean R

2007-06-01

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

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

Science.gov (United States)

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

2017-03-01

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

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.

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

Science.gov (United States)

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

2008-07-31

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

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.

On the stretch factor of convex Delaunay graphs

Directory of Open Access Journals (Sweden)

Prosenjit Bose

2010-06-01

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

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.

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

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

Science.gov (United States)

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

2015-07-15

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

Characterisation of neuroprotective efficacy of modified poly-arginine-9 (R9) peptides using a neuronal glutamic acid excitotoxicity model.

Science.gov (United States)

Edwards, Adam B; Anderton, Ryan S; Knuckey, Neville W; Meloni, Bruno P

2017-02-01

In a recent study, we highlighted the importance of cationic charge and arginine residues for the neuroprotective properties of poly-arginine and arginine-rich peptides. In this study, using cortical neuronal cultures and an in vitro glutamic acid excitotoxicity model, we examined the neuroprotective efficacy of different modifications to the poly-arginine-9 peptide (R9). We compared an unmodified R9 peptide with R9 peptides containing the following modifications: (i) C-terminal amidation (R9-NH2); (ii) N-terminal acetylation (Ac-R9); (iii) C-terminal amidation with N-terminal acetylation (Ac-R9-NH2); and (iv) C-terminal amidation with D-amino acids (R9D-NH2). The three C-terminal amidated peptides (R9-NH2, Ac-R9-NH2, and R9D-NH2) displayed neuroprotective effects greater than the unmodified R9 peptide, while the N-terminal acetylated peptide (Ac-R9) had reduced efficacy. Using the R9-NH2 peptide, neuroprotection could be induced with a 10 min peptide pre-treatment, 1-6 h before glutamic acid insult, or when added to neuronal cultures up to 45 min post-insult. In addition, all peptides were capable of reducing glutamic acid-mediated neuronal intracellular calcium influx, in a manner that reflected their neuroprotective efficacy. This study further highlights the neuroprotective properties of poly-arginine peptides and provides insight into peptide modifications that affect efficacy.

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

Czech Academy of Sciences Publication Activity Database

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

2014-01-01

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

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.

Redetermined structure of gossypol (P3 polymorph

Directory of Open Access Journals (Sweden)

Muhabbat Honkeldieva

2015-07-01

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

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

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.

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

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

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

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

On the classification of nonsimple graph C*-algebras

DEFF Research Database (Denmark)

Eilers, Søren; Tomforde, Mark

2010-01-01

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

Cycles through all finite vertex sets in infinite graphs

DEFF Research Database (Denmark)

Kundgen, Andre; Li, Binlong; Thomassen, Carsten

2017-01-01

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

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

Directory of Open Access Journals (Sweden)

Jinki Kim

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

Heteromeric p97/p97R155C complexes induce dominant negative changes in wild-type and autophagy 9-deficient Dictyostelium strains.

Directory of Open Access Journals (Sweden)

Khalid Arhzaouy

Full Text Available Heterozygous mutations in the human VCP (p97 gene cause autosomal-dominant IBMPFD (inclusion body myopathy with early onset Paget's disease of bone and frontotemporal dementia, ALS14 (amyotrophic lateral sclerosis with or without frontotemporal dementia and HSP (hereditary spastic paraplegia. Most prevalent is the R155C point mutation. We studied the function of p97 in the social amoeba Dictyostelium discoideum and have generated strains that ectopically express wild-type (p97 or mutant p97 (p97(R155C fused to RFP in AX2 wild-type and autophagy 9 knock-out (ATG9(KO cells. Native gel electrophoresis showed that both p97 and p97(R155C assemble into hexamers. Co-immunoprecipitation studies revealed that endogenous p97 and p97(R155C-RFP form heteromers. The mutant strains displayed changes in cell growth, phototaxis, development, proteasomal activity, ubiquitinylated proteins, and ATG8(LC3 indicating mis-regulation of multiple essential cellular processes. Additionally, immunofluorescence analysis revealed an increase of protein aggregates in ATG9(KO/p97(R155C-RFP and ATG9(KO cells. They were positive for ubiquitin in both strains, however, solely immunoreactive for p97 in the ATG9(KO mutant. A major finding is that the expression of p97(R155C-RFP in the ATG9(KO strain partially or fully rescued the pleiotropic phenotype. We also observed dose-dependent effects of p97 on several cellular processes. Based on findings in the single versus the double mutants we propose a novel mode of p97 interaction with the core autophagy protein ATG9 which is based on mutual inhibition.

~ i t i d e r m a t o ~ h ~ t i c Activities of Nine (9) Essential Oils J.R. ...

African Journals Online (AJOL)

i t i d e r m a t o ~ h ~ t i c Activities of Nine (9) Essential Oils. J.R. KUIATE", S.P. KUATE'.~, N.E. KEMADJOU~, S. DJOKOUA~, F. ZIFACK~ AND J. ~. 0. ~. 0. ~. I Department of Biochemistry, FS, University of Dschang, P.O. Box 67 Dschang, Cameroon. 2~epartment of Biochemistry, FS, University of Yaoundt!, P.O. Box 812 ...

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.

47 CFR 95.221 - (R/C Rule 21) How do I have my R/C transmitter serviced?

Science.gov (United States)

2010-10-01

... FCC certificated R/C transmitter (see R/C Rule 9) must be made in accord with the Technical... in order to: (1) Adjust a transmitter to an antenna; (2) Detect or measure radiation of energy other...

The KYxxL motif in Rad17 protein is essential for the interaction with the 9–1–1 complex

Energy Technology Data Exchange (ETDEWEB)

Fukumoto, Yasunori, E-mail: fukumoto@faculty.chiba-u.jp [Laboratory of Molecular Cell Biology, Graduate School of Pharmaceutical Sciences, Chiba University, Chiba 260-8675 (Japan); Ikeuchi, Masayoshi; Nakayama, Yuji [Department of Biochemistry & Molecular Biology, Kyoto Pharmaceutical University, Kyoto 607-8414 (Japan); Yamaguchi, Naoto, E-mail: nyama@faculty.chiba-u.jp [Laboratory of Molecular Cell Biology, Graduate School of Pharmaceutical Sciences, Chiba University, Chiba 260-8675 (Japan)

2016-09-02

ATR-dependent DNA damage checkpoint is the major DNA damage checkpoint against UV irradiation and DNA replication stress. The Rad17–RFC and Rad9–Rad1–Hus1 (9–1–1) complexes interact with each other to contribute to ATR signaling, however, the precise regulatory mechanism of the interaction has not been established. Here, we identified a conserved sequence motif, KYxxL, in the AAA+ domain of Rad17 protein, and demonstrated that this motif is essential for the interaction with the 9–1–1 complex. We also show that UV-induced Rad17 phosphorylation is increased in the Rad17 KYxxL mutants. These data indicate that the interaction with the 9–1–1 complex is not required for Rad17 protein to be an efficient substrate for the UV-induced phosphorylation. Our data also raise the possibility that the 9–1–1 complex plays a negative regulatory role in the Rad17 phosphorylation. We also show that the nucleotide-binding activity of Rad17 is required for its nuclear localization. - Highlights: • We have identified a conserved KYxxL motif in Rad17 protein. • The KYxxL motif is crucial for the interaction with the 9–1–1 complex. • The KYxxL motif is dispensable or inhibitory for UV-induced Rad17 phosphorylation. • Nucleotide binding of Rad17 is required for its nuclear localization.

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

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.

Factor VII R353Q genetic polymorphism is associated with altered warfarin sensitivity among CYP2C9 *1/*1 carriers.

Science.gov (United States)

Mlynarsky, Liat; Bejarano-Achache, Idit; Muszkat, Mordechai; Caraco, Yoseph

2012-05-01

Warfarin responsiveness is characterized by marked interindividual variability. A major portion of this variability is attributed to CYP2C9 and VKORC1 polymorphisms, but almost 50% is still unaccounted for. This paper reports the first prospective study on the association between factor VII R353Q polymorphism and warfarin responsiveness during induction. Genotyping for factor VII R353Q and 323D/I polymorphisms was performed in a cohort consisting of 374 patients (198 CYP2C9*1/*1) treated with warfarin who were prospectively followed from warfarin initiation. Compared with *1/*1-R/R and *1/*1-R/Q genotype carriers, *1/*1-Q/Q homozygotes achieved higher International Normalized Ratio (INR) values while consuming lower warfarin doses. The greater sensitivity was illustrated by 82.1% higher Warfarin Sensitivity Index During Induction (WSIDI) (0.14 ± 0.11 vs. 0.08 ± 0.50 mg⁻¹ Mann-Whitney, P = 0.043). Multiple regression analysis consisting of both genetic and nongenetic factors explained 26% of WSIDI variability, with R353Q genetic polymorphism having a modest yet significant effect and accounting for 1.7% of the overall variability. Moreover, the incidence of overanticoagulation (i.e., INR > 4) was 6.94-fold higher among *1/*1-Q/Q vs. *1/*1-R/R&R/Q carriers during warfarin induction (Pearson chi-square, P = 0.005). These findings were not accounted for by a chance difference in the distribution of VKORC1 genotypes. Analysis of these parameters among the entire cohort, including CYP2C9*2 and CYP2C9*3 variant allele carriers, did not reach statistical significance. Warfarin responsiveness during induction was unrelated to factor VII 323D/I genetic polymorphism. The response to warfarin during induction is influenced by factor VII R353Q polymorphism. The prospective use of this polymorphism, along with CYP2C9 and VKORC1, may enhance the accuracy of warfarin loading. However, the impact of R353Q polymorphism on overall warfarin response is subtle, and it is therefore

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.

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

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

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.

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/

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

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

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

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

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

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.

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.

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

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.

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)

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

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.

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

Multiparameter elastic full-waveform inversion in the presence of azimuthally rotated orthorhombic anisotropy: Application to 9-C land data

KAUST Repository

Oh, Juwon

2017-08-17

To examine the feasibility of elastic full waveform inversion (FWI) for azimuthally rotated orthorhombic (rORT) media, we analyze the sensitivity of the 9-component (9C) land data set acquired on the surface on each of the ORT parameters. The trade-off analysis supports that the parameter set that includes deviation parameters offers the best choice for a 9C data set. Compared to the data from an explosive source, using the 9C land data, ORT parameters show different trade-off patterns for the different source and receiver components. For this reason, finding an optimal component considering trade-offs is another important issue to better recover subsurface rotated orthorhombic anisotropy.

Transcriptional regulation of miR-146b by C/EBPβ LAP2 in esophageal cancer cells

International Nuclear Information System (INIS)

Li, Junxia; Shan, Fabo; Xiong, Gang; Wang, Ju-Ming; Wang, Wen-Lin; Xu, Xueqing; Bai, Yun

2014-01-01

Highlights: • MiR-146b promotes esophageal cancer cell proliferation. • MiR-146b inhibits esophageal cancer cell apoptosis. • C/EBPβ directly binds to miR-146b promoter conserved region. • MiR-146b is up-regulated by C/EBPβ LAP2 transcriptional activation. - Abstract: Recent clinical study indicated that up-regulation of miR-146b was associated with poor overall survival of patients in esophageal squamous cell carcinoma. However, the underlying mechanism of miR-146b dysregulation remains to be explored. Here we report that miR-146b promotes cell proliferation and inhibits cell apoptosis in esophageal cancer cell lines. Mechanismly, two C/EBPβ binding motifs are located in the miR-146b promoter conserved region. Among the three isoforms of C/EBPβ, C/EBPβ LAP2 positively regulated miR-146b expression and increases miR-146b levels in a dose-dependent manner through transcription activation of miR-146b gene. Together, these results suggest a miR-146b regulatory mechanism involving C/EBPβ, which may contribute to the up-regulation of miR-146b in esophageal squamous cell carcinoma

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

1999-01-01

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

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

Crossed products for interactions and graph algebras

DEFF Research Database (Denmark)

Kwasniewski, Bartosz

2014-01-01

We consider Exel’s interaction (V,H) over a unital C*-algebra A, such that V(A) and H(A) are hereditary subalgebras of A. For the associated crossed product, we obtain a uniqueness theorem, ideal lattice description, simplicity criterion and a version of Pimsner–Voiculescu exact sequence. These r......We consider Exel’s interaction (V,H) over a unital C*-algebra A, such that V(A) and H(A) are hereditary subalgebras of A. For the associated crossed product, we obtain a uniqueness theorem, ideal lattice description, simplicity criterion and a version of Pimsner–Voiculescu exact sequence....... These results cover the case of crossed products by endomorphisms with hereditary ranges and complemented kernels. As model examples of interactions not coming from endomorphisms we introduce and study in detail interactions arising from finite graphs. The interaction (V,H) associated to a graph E acts...... on the core F_E of the graph algebra C*(E). By describing a partial homeomorphism dual to (V,H) we find the fundamental structure theorems for C*(E), such as Cuntz–Krieger uniqueness theorem, as results concerning reversible noncommutative dynamics on F_E . We also provide a new approach to calculation of K...

The discovery of 9/8-ribbons, β/γ-peptides with curved shapes governed by a combined configuration-conformation code.

Science.gov (United States)

Grison, Claire M; Robin, Sylvie; Aitken, David J

2015-11-21

The de novo design of a β/γ-peptidic foldamer motif has led to the discovery of an unprecedented 9/8-ribbon featuring an uninterrupted alternating C9/C8 hydrogen-bonding network. The ribbons adopt partially curved topologies determined synchronistically by the β-residue configuration and the γ-residue conformation sets.

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.

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.

Crystal structure of 4-allylsulfanyl-1H-pyrazolo[3,4-d]pyrimidine

Directory of Open Access Journals (Sweden)

Mohammed El Fal

2014-09-01

Full Text Available In the title compound, C8H8N4S, the pyrazolo[3,4-d]pyrimidine ring system is essentially planar, with a maximum deviation from the mean plane of 0.025 (3 Å. The allyl group is disordered over two sites in a 0.512 (6:0.488 (6 ratio. In the crystal, molecules are linked by pairs of N—H...N hydrogen bonds, forming inversion dimers with an R22(8 graph-set motif.

R{sub 4}Ir{sub 13}Ge{sub 9} (R=La, Ce, Pr, Nd, Sm) and RIr{sub 3}Ge{sub 2} (R=La, Ce, Pr, Nd): Crystal structures with nets of Ir atoms

Energy Technology Data Exchange (ETDEWEB)

Yarema, Maksym [Department of Inorganic Chemistry, Ivan Franko National University of Lviv, Kyryla i Mefodiya Str, 6, UA-79005 Lviv (Ukraine); Swiss Federal Laboratories for Materials Science and Technology (EMPA), Ueberlandstr. 129, CH-8600 Duebendorf (Switzerland); Zaremba, Oksana; Gladyshevskii, Roman [Department of Inorganic Chemistry, Ivan Franko National University of Lviv, Kyryla i Mefodiya Str, 6, UA-79005 Lviv (Ukraine); Hlukhyy, Viktor, E-mail: viktor.hlukhyy@lrz.tu-muenchen.de [Department Chemie, Technische Universitaet Muenchen, Lichtenbergstr. 4, D-85747 Garching (Germany); Faessler, Thomas F. [Department Chemie, Technische Universitaet Muenchen, Lichtenbergstr. 4, D-85747 Garching (Germany)

2012-12-15

The crystal structures of the new ternary compounds Sm{sub 4}Ir{sub 13}Ge{sub 9} and LaIr{sub 3}Ge{sub 2} were determined and refined on the basis of single-crystal X-ray diffraction data. They belong to the Ho{sub 4}Ir{sub 13}Ge{sub 9} (oP52, Pmmn) and CeCo{sub 3}B{sub 2} (hP5, P6/mmm) structure types, respectively. The formation of isotypic compounds R{sub 4}Ir{sub 13}Ge{sub 9} with R=La, Ce, Pr, Nd, and RIr{sub 3}Ge{sub 2} with R=Ce, Pr, Nd, was established by powder X-ray diffraction. The RIr{sub 3}Ge{sub 2} (R=La, Ce, Pr, Nd) compounds exist only in as-cast samples and decompose during annealing at 800 Degree-Sign C with the formation of R{sub 4}Ir{sub 13}Ge{sub 9}. The structure of Sm{sub 4}Ir{sub 13}Ge{sub 9} contains intersecting, slightly puckered nets of Ir atoms (4{sup 4})(4{sup 3}.6){sub 2}(4.6{sup 2}){sub 2} and (4{sup 4}){sub 2}(4{sup 3}.6){sub 4}(4.6{sup 2}){sub 2} that are perpendicular to [0 1 1] as well as to [0 -1 1] and [0 0 1]. The Ir atoms are surrounded by Ge atoms that form tetrahedra or square pyramids (where the layers intersect). The Sm and additional Ir atoms (in trigonal-planar coordination) are situated in channels along [1 0 0] (short translation vector). In the structure of LaIr{sub 3}Ge{sub 2} the Ir atoms form planar Kagome nets (3.6.3.6) perpendicular to [0 0 1]. These nets alternate along the short translation vector with layers of La and Ge atoms. - Graphical abstract: The crystal structures contain the nets of Ir atoms as main structural motif: R{sub 4}Ir{sub 13}Ge{sub 9} contains intersecting slightly puckered nets of Ir atoms, whereas in the structure of RIr{sub 3}Ge{sub 2} the Ir atoms form planar Kagome nets. Highlights: Black-Right-Pointing-Pointer The Ir-rich ternary germanides R{sub 4}Ir{sub 13}Ge{sub 9} (R=La, Ce, Pr, Nd, Sm) and RIr{sub 3}Ge{sub 2} (R=La, Ce, Pr, Nd) have been synthesized. Black-Right-Pointing-Pointer The RIr{sub 3}Ge{sub 2} compounds exist only in as-cast samples and decompose during annealing at 800

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

4-(3-Bromopropyloxy-1-hydroxy-9,10-anthraquinone

Directory of Open Access Journals (Sweden)

Natsumi Ohira

2016-05-01

Full Text Available In the molecule of the title compound, C17H13BrO4, the anthraquinone ring system is slightly bent, with a dihedral angle of 169.99 (7° between the planes of the two benzene rings. The side chain (O—C—C—C—Br has a gauche–gauche conformation, as indicated by the O—C—C—C and C—C—C—Br torsion angles of −66.9 (2 and −65.8 (2°, respectively. In addition, there is an intramolecular O—H...O hydrogen bond enclosing an S(6 ring motif. The hydrogen-bond donor is bifurcated; in the crystal, a pair of O—H...O hydrogen bonds connects two molecules, forming an inversion dimer with an R22(12 ring motif.

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.

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.

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

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

Long range order and giant components of quantum random graphs

CERN Document Server

Ioffe, D

2006-01-01

Mean field quantum random graphs give a natural generalization of classical Erd\\H{o}s-R\\'{e}nyi percolation model on complete graph $G_N$ with $p =\\beta /N$. Quantum case incorporates an additional parameter $\\lambda\\geq 0$, and the short-long range order transition should be studied in the $(\\beta ,\\lambda)$-quarter plane. In this work we explicitly compute the corresponding critical curve $\\gamma_c$, and derive results on two-point functions and sizes of connected components in both short and long range order regions. In this way the classical case corresponds to the limiting point $(\\beta_c ,0) = (1,0)$ on $\\gamma_c$.

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.

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.

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)

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

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.

Bayesian centroid estimation for motif discovery.

Science.gov (United States)

Carvalho, Luis

2013-01-01

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

Bayesian centroid estimation for motif discovery.

Directory of Open Access Journals (Sweden)

Luis Carvalho

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

Quantum walk on a chimera graph

Science.gov (United States)

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

2018-05-01

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

A cut locus for finite graphs and the farthest point mapping

DEFF Research Database (Denmark)

Maddaloni, Alessandro; Zamfirescu, Carol T.

2016-01-01

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

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.

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

Science.gov (United States)

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

2016-03-14

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

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

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

Flow condensation heat transfer coefficients of R22, R134a, R407C, and R410A inside plain and microfin tubes

Energy Technology Data Exchange (ETDEWEB)

Jung, Dongsoo; Cho, Youngmok; Park, Kiho [Inha Univ., Incheon (Korea). Dept. of Mechanical Engineering

2004-01-01

Flow condensation heat transfer coefficients (HTCs) of R22, R134a, R407C, and R410A inside horizontal plain and microfin tubes of 9.52 mm outside diameter and 1 m length were measured at the condensation temperature of 40{sup o}C with mass fluxes of 100, 200, and 300 kg m{sup -2} s{sup -1} and a heat flux of 7.7-7.9 kW m{sup -2}. For a plain tube, HTCs of R134a and R410A were similar to those of R22 while HTCs of R407C are 11-15% lower than those of R22. For a microfin tube, HTCs of R134a were similar to those of R22 while HTCs of R407C and R410A were 23-53% and 10-21% lower than those of R22. For a plain tube, our correlation agreed well with the present data for all refrigerants exhibiting a mean deviation of 11.6%. Finally, HTCs of a microfin tube were 2-3 times higher than those of a plain tube and the heat transfer enhancement factor decreased as the mass flux increased for all refrigerants tested. (Author)

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

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

Distance-transitive graphs

NARCIS (Netherlands)

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

2004-01-01

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

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

Directory of Open Access Journals (Sweden)

Emmersen Jeppe

2010-05-01

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

A Characterization of 2-Tree Probe Interval Graphs

Directory of Open Access Journals (Sweden)

Brown David E.

2014-08-01

Full Text Available A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P. We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl. Math. 150 (2005 216-231

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

Phyloproteomic Analysis of 11780 Six-Residue-Long Motifs Occurrences

Directory of Open Access Journals (Sweden)

O. V. Galzitskaya

2015-01-01

Full Text Available How is it possible to find good traits for phylogenetic reconstructions? Here, we present a new phyloproteomic criterion that is an occurrence of simple motifs which can be imprints of evolution history. We studied the occurrences of 11780 six-residue-long motifs consisting of two randomly located amino acids in 97 eukaryotic and 25 bacterial proteomes. For all eukaryotic proteomes, with the exception of the Amoebozoa, Stramenopiles, and Diplomonadida kingdoms, the number of proteins containing the motifs from the first group (one of the two amino acids occurs once at the terminal position made about 20%; in the case of motifs from the second (one of two amino acids occurs one time within the pattern and third (the two amino acids occur randomly groups, 30% and 50%, respectively. For bacterial proteomes, this relationship was 10%, 27%, and 63%, respectively. The matrices of correlation coefficients between numbers of proteins where a motif from the set of 11780 motifs appears at least once in 9 kingdoms and 5 phyla of bacteria were calculated. Among the correlation coefficients for eukaryotic proteomes, the correlation between the animal and fungi kingdoms (0.62 is higher than between fungi and plants (0.54. Our study provides support that animals and fungi are sibling kingdoms. Comparison of the frequencies of six-residue-long motifs in different proteomes allows obtaining phylogenetic relationships based on similarities between these frequencies: the Diplomonadida kingdoms are more close to Bacteria than to Eukaryota; Stramenopiles and Amoebozoa are more close to each other than to other kingdoms of Eukaryota.

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

Science.gov (United States)

Schulz, Tizian; Stoye, Jens; Doerr, Daniel

2018-05-08

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

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

African Journals Online (AJOL)

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

rRNA C-Loops: Mechanical Properties of a Recurrent Structural Motif

Czech Academy of Sciences Publication Activity Database

Dršata, Tomáš; Réblová, K.; Beššeová, Ivana; Šponer, Jiří; Lankaš, Filip

2017-01-01

Roč. 13, č. 7 (2017), s. 3359-3371 ISSN 1549-9618 R&D Projects: GA ČR(CZ) GA14-21893S Institutional support: RVO:61388963 ; RVO:68081707 Keywords : molecular dynamics simulations * residual dipolar couplings * A-site finger Subject RIV: BO - Biophysics OBOR OECD: Biophysics Impact factor: 5.245, year: 2016

Piv site-specific invertase requires a DEDD motif analogous to the catalytic center of the RuvC Holliday junction resolvases.

Science.gov (United States)

Buchner, John M; Robertson, Anne E; Poynter, David J; Denniston, Shelby S; Karls, Anna C

2005-05-01

Piv, a unique prokaryotic site-specific DNA invertase, is related to transposases of the insertion elements from the IS110/IS492 family and shows no similarity to the site-specific recombinases of the tyrosine- or serine-recombinase families. Piv tertiary structure is predicted to include the RNase H-like fold that typically encompasses the catalytic site of the recombinases or nucleases of the retroviral integrase superfamily, including transposases and RuvC-like Holliday junction resolvases. Analogous to the DDE and DEDD catalytic motifs of transposases and RuvC, respectively, four Piv acidic residues D9, E59, D101, and D104 appear to be positioned appropriately within the RNase H fold to coordinate two divalent metal cations. This suggests mechanistic similarity between site-specific inversion mediated by Piv and transposition or endonucleolytic reactions catalyzed by enzymes of the retroviral integrase superfamily. The role of the DEDD motif in Piv catalytic activity was addressed using Piv variants that are substituted individually or multiply at these acidic residues and assaying for in vivo inversion, intermolecular recombination, and DNA binding activities. The results indicate that all four residues of the DEDD motif are required for Piv catalytic activity. The DEDD residues are not essential for inv recombination site recognition and binding, but this acidic tetrad does appear to contribute to the stability of Piv-inv interactions. On the basis of these results, a working model for Piv-mediated inversion that includes resolution of a Holliday junction is presented.

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

Directory of Open Access Journals (Sweden)

Włodzimierz Ulatowski

2015-01-01

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

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-11-12

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

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.

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

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

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

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

Enhanced SUMOylation of proteins containing a SUMO-interacting motif by SUMO-Ubc9 fusion

International Nuclear Information System (INIS)

Kim, Eui Tae; Kim, Kyeong Kyu; Matunis, Mike J.; Ahn, Jin-Hyun

2009-01-01

Identifying new targets for SUMO and understanding the function of protein SUMOylation are largely limited by low level of SUMOylation. It was found recently that Ubc9, the SUMO E2 conjugating enzyme, is covalently modified by SUMO at a lysine 14 in the N-terminal alpha helix, and that SUMO-modified Ubc9 has enhanced conjugation activity for certain target proteins containing a SUMO-interacting motif (SIM). Here, we show that, compared to intact Ubc9, the SUMO-Ubc9 fusion protein has higher conjugating activity for SIM-containing targets such as Sp100 and human cytomegalovirus IE2. Assays using an IE2 SIM mutant revealed the requirement of SIM for the enhanced IE2 SUMOylation by SUMO-Ubc9. In pull-down assays with cell extracts, the SUMO-Ubc9 fusion protein bound to more diverse cellular proteins and interacted with some SIM-containing proteins with higher affinities than Ubc9. Therefore, the devised SUMO-Ubc9 fusion will be useful for identifying SIM-containing SUMO targets and producing SUMO-modified proteins.

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

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.

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.

Identification of helix capping and {beta}-turn motifs from NMR chemical shifts

Energy Technology Data Exchange (ETDEWEB)

Shen Yang; Bax, Ad, E-mail: bax@nih.gov [National Institutes of Health, Laboratory of Chemical Physics, National Institute of Diabetes and Digestive and Kidney Diseases (United States)

2012-03-15

We present an empirical method for identification of distinct structural motifs in proteins on the basis of experimentally determined backbone and {sup 13}C{sup {beta}} chemical shifts. Elements identified include the N-terminal and C-terminal helix capping motifs and five types of {beta}-turns: I, II, I Prime , II Prime and VIII. Using a database of proteins of known structure, the NMR chemical shifts, together with the PDB-extracted amino acid preference of the helix capping and {beta}-turn motifs are used as input data for training an artificial neural network algorithm, which outputs the statistical probability of finding each motif at any given position in the protein. The trained neural networks, contained in the MICS (motif identification from chemical shifts) program, also provide a confidence level for each of their predictions, and values ranging from ca 0.7-0.9 for the Matthews correlation coefficient of its predictions far exceed those attainable by sequence analysis. MICS is anticipated to be useful both in the conventional NMR structure determination process and for enhancing on-going efforts to determine protein structures solely on the basis of chemical shift information, where it can aid in identifying protein database fragments suitable for use in building such structures.

Identification of helix capping and β-turn motifs from NMR chemical shifts

International Nuclear Information System (INIS)

Shen Yang; Bax, Ad

2012-01-01

We present an empirical method for identification of distinct structural motifs in proteins on the basis of experimentally determined backbone and 13 C β chemical shifts. Elements identified include the N-terminal and C-terminal helix capping motifs and five types of β-turns: I, II, I′, II′ and VIII. Using a database of proteins of known structure, the NMR chemical shifts, together with the PDB-extracted amino acid preference of the helix capping and β-turn motifs are used as input data for training an artificial neural network algorithm, which outputs the statistical probability of finding each motif at any given position in the protein. The trained neural networks, contained in the MICS (motif identification from chemical shifts) program, also provide a confidence level for each of their predictions, and values ranging from ca 0.7–0.9 for the Matthews correlation coefficient of its predictions far exceed those attainable by sequence analysis. MICS is anticipated to be useful both in the conventional NMR structure determination process and for enhancing on-going efforts to determine protein structures solely on the basis of chemical shift information, where it can aid in identifying protein database fragments suitable for use in building such structures.

cWords - systematic microRNA regulatory motif discovery from mRNA expression data

DEFF Research Database (Denmark)

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

2013-01-01

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

Graph Transforming Java Data

NARCIS (Netherlands)

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

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

On a Fuzzy Algebra for Querying Graph Databases

OpenAIRE

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

2014-01-01

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

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

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.

Crystal structure of (1S,3R,8R,9R-2,2-dichloro-3,7,7-trimethyl-10-methylenetricyclo[6.4.0.01,3]dodecan-9-ol

Directory of Open Access Journals (Sweden)

Ahmed Benzalim

2016-08-01

Full Text Available The title compound, C16H24Cl2O, was synthesized by treating (1S,3R,8S,9R,10S-2,2-dichloro-3,7,7,10-tetramethyl-9,10-epoxytricyclo[6.4.0.01,3]dodecane with a concentrated solution of hydrobromic acid. It is built up from three fused rings: a cycloheptane ring, a cyclohexyl ring bearing alkene and hydroxy substituents, and a cyclopropane ring bearing two chlorine atoms. The asymmetric unit contains two molecules linked by an O—H...O hydrogen bond. In the crystal, further O—H...O hydrogen bonds build up an R44(8 cyclic tetramer. One of the molecules presents disorder that affects the seven-membered ring. In both molecules, the six-membered rings display a chair conformation, whereas the seven-membered rings display conformations intermediate between boat and twist-boat for the non-disordered molecule and either a chair or boat and twist-boat for the disordered molecule owing to the disorder. The absolute configuration for both molecules is 1S,3R,8R,9R and was deduced from the chemical pathway and further confirmed by the X-ray structural analysis.

Motif enrichment tool.

Science.gov (United States)

Blatti, Charles; Sinha, Saurabh

2014-07-01

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

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

Science.gov (United States)

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

1999-01-01

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

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

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.

Identification and Characterization of an Antifungal Protein, AfAFPR9, Produced by Marine-Derived Aspergillus fumigatus R9.

Science.gov (United States)

Rao, Qi; Guo, Wenbin; Chen, Xinhua

2015-05-01

A fungal strain, R9, was isolated from the South Atlantic sediment sample and identified as Aspergillus fumigatus. An antifungal protein, AfAFPR9, was purified from the culture supernatant of Aspergillus fumigatus R9. AfAFPR9 was identified to be restrictocin, which is a member of the ribosome-inactivating proteins (RIPs), by MALDI-TOF-TOF-MS. AfAFPR9 displayed antifungal activity against plant pathogenic Fusarium oxysporum, Alternaria longipes, Colletotrichum gloeosporioides, Paecilomyces variotii, and Trichoderma viride at minimum inhibitory concentrations of 0.6, 0.6, 1.2, 1.2, and 2.4 μg/disc, respectively. Moreover, AfAFPR9 exhibited a certain extent of thermostability, and metal ion and denaturant tolerance. The iodoacetamide assay showed that the disulfide bridge in AfAFPR9 was indispensable for its antifungal action. The cDNA encoding for AfAFPR9 was cloned from A. fumigatus R9 by RTPCR and heterologously expressed in E. coli. The recombinant AfAFPR9 protein exhibited obvious antifungal activity against C. gloeosporioides, T. viride, and A. longipes. These results reveal the antifungal properties of a RIP member (AfAFPR9) from marine-derived Aspergillus fumigatus and indicated its potential application in controlling plant pathogenic fungi.

Parallel computing for data science with examples in R, C++ and CUDA

CERN Document Server

Matloff, Norman

2015-01-01

Parallel Computing for Data Science: With Examples in R, C++ and CUDA is one of the first parallel computing books to concentrate exclusively on parallel data structures, algorithms, software tools, and applications in data science. It includes examples not only from the classic ""n observations, p variables"" matrix format but also from time series, network graph models, and numerous other structures common in data science. The examples illustrate the range of issues encountered in parallel programming.With the main focus on computation, the book shows how to compute on three types of platfor

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.

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

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

Science.gov (United States)

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

2018-02-23

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

Gems of combinatorial optimization and graph algorithms

CERN Document Server

Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea

2015-01-01

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

Sparse geometric graphs with small dilation

NARCIS (Netherlands)

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

2005-01-01

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

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.

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

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

Science.gov (United States)

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

2014-07-01

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

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

NARCIS (Netherlands)

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

2016-01-01

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

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.

The BsaHI restriction-modification system: Cloning, sequencing and analysis of conserved motifs

Directory of Open Access Journals (Sweden)

Roberts Richard J

2008-05-01

Full Text Available Abstract Background Restriction and modification enzymes typically recognise short DNA sequences of between two and eight bases in length. Understanding the mechanism of this recognition represents a significant challenge that we begin to address for the BsaHI restriction-modification system, which recognises the six base sequence GRCGYC. Results The DNA sequences of the genes for the BsaHI methyltransferase, bsaHIM, and restriction endonuclease, bsaHIR, have been determined (GenBank accession #EU386360, cloned and expressed in E. coli. Both the restriction endonuclease and methyltransferase enzymes share significant similarity with a group of 6 other enzymes comprising the restriction-modification systems HgiDI and HgiGI and the putative HindVP, NlaCORFDP, NpuORFC228P and SplZORFNP restriction-modification systems. A sequence alignment of these homologues shows that their amino acid sequences are largely conserved and highlights several motifs of interest. We target one such conserved motif, reading SPERRFD, at the C-terminal end of the bsaHIR gene. A mutational analysis of these amino acids indicates that the motif is crucial for enzymatic activity. Sequence alignment of the methyltransferase gene reveals a short motif within the target recognition domain that is conserved among enzymes recognising the same sequences. Thus, this motif may be used as a diagnostic tool to define the recognition sequences of the cytosine C5 methyltransferases. Conclusion We have cloned and sequenced the BsaHI restriction and modification enzymes. We have identified a region of the R. BsaHI enzyme that is crucial for its activity. Analysis of the amino acid sequence of the BsaHI methyltransferase enzyme led us to propose two new motifs that can be used in the diagnosis of the recognition sequence of the cytosine C5-methyltransferases.

Sampling Large Graphs for Anticipatory Analytics

Science.gov (United States)

2015-05-15

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

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

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

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.

The Shrikhande Graph

Indian Academy of Sciences (India)

IAS Admin

the configurations similar to those discussed in this ex- position followed a fruitful .... order 4 (recall that A △ B denotes the set of all those elements that are ..... C R Rao, Special issue devoted to the memory of R C Bose, Sankhya,. 54, 1992. [4].

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.

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

Directory of Open Access Journals (Sweden)

Joshi NV

2009-01-01

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

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

Science.gov (United States)

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

2017-05-01

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

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.

Peripheral metabolism of (R)-[11C]verapamil in epilepsy patients

International Nuclear Information System (INIS)

Abrahim, Aiman; Langer, Oliver; Luurtsema, Gert; Lubberink, Mark; Lammertsma, Adriaan A.; Bauer, Martin; Joukhadar, Christian; Mueller, Markus; Karch, Rudolf; Pataraia, Ekaterina; Baumgartner, Christoph; Kletter, Kurt

2008-01-01

(R)-[ 11 C]verapamil is a new PET tracer for P-glycoprotein-mediated transport at the blood-brain barrier. For kinetic analysis of (R)-[ 11 C]verapamil PET data the measurement of a metabolite-corrected arterial input function is required. The aim of this study was to assess peripheral (R)-[ 11 C]verapamil metabolism in patients with temporal lobe epilepsy and compare these data with previously reported data from healthy volunteers. Arterial blood samples were collected from eight patients undergoing (R)-[ 11 C]verapamil PET and selected samples were analysed for radiolabelled metabolites of (R)-[ 11 C]verapamil by using an assay that measures polar N-demethylation metabolites by solid-phase extraction and lipophilic N-dealkylation metabolites by HPLC. Peripheral metabolism of (R)-[ 11 C]verapamil was significantly faster in patients compared to healthy volunteers (AUC of (R)-[ 11 C]verapamil fraction in plasma: 29.4 ± 3.9 min for patients versus 40.8 ± 5.0 min for healthy volunteers; p 11 C]verapamil plasma concentrations (AUC of (R)-[ 11 C]verapamil concentration, normalised to injected dose per body weight: 25.5 ± 2.1 min for patients and 30.5 ± 5.9 min for healthy volunteers; p = 0.038). Faster metabolism appeared to be mainly due to increased N-demethylation as the polar [ 11 C]metabolite fraction was up to two-fold greater in patients. Faster metabolism of (R)-[ 11 C]verapamil in epilepsy patients may be caused by hepatic cytochrome P450 enzyme induction by antiepileptic drugs. Based on these data caution is warranted when using an averaged arterial input function derived from healthy volunteers for the analysis of patient data. Moreover, our data illustrate how antiepileptic drugs may decrease serum levels of concomitant medication, which may eventually lead to a loss of therapeutic efficacy. (orig.)

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.

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

Science.gov (United States)

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

2011-01-01

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

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

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

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.

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)

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

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.

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.

Variational and PDE-Based Methods for Big Data Analysis, Classification and Image Processing Using Graphs

Science.gov (United States)

2015-01-01

Assistant for Calculus (winter 2011) xii CHAPTER 1 Introduction We present several methods, outlined in Chapters 3-5, for image processing and data...local calculus formulation [103] to generalize the continuous formulation to a (non-local) discrete setting, while other non-local versions for...graph-based model based on the Ginzburg-Landau functional in their work [9]. To define the functional on a graph, the spatial gradient is replaced by a

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.

Isopiestic determination of the osmotic coefficient and vapour pressure of N-R-4-(N,N-dimethylamino)pyridinium tetrafluoroborate (R = C4H9, C5H11, C6H13) in the ethanol solution at T = 298.15 K

International Nuclear Information System (INIS)

Sardroodi, Jaber Jahanbin; Atabay, Maryam; Azamat, Jafar

2012-01-01

Highlights: ► The osmotic coefficients of the solutions of ionic liquid in ethanol have been measured. ► Measured osmotic coefficients were correlated using Pitzer, e-NRTL and NRF models and polynomial equation. ► Vapour pressures were evaluated from the correlated osmotic coefficients. - Abstract: Osmotic coefficients of the solutions of room temperature ionic liquid N-R-4-(N,N-dimethylamino)pyridinium tetrafluoroborate (R = C 4 H 9 , C 5 H 11 , C 6 H 13 ) in ethanol have been measured at T = 298.15 K by the isopiestic method. The experimental osmotic coefficients have been correlated using the ion interaction model of Pitzer, electrolyte non-random two liquid (e-NRTL) model of Chen, non-random factor (NRF) and a fourth-order polynomial in terms of molality. The vapour pressures of the solutions studied have been evaluated from the osmotic coefficients.

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\

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)

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.

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

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

Science.gov (United States)

Leskovec, Jure; Sosič, Rok

2016-10-01

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

MotifNet: a web-server for network motif analysis.

Science.gov (United States)

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

2017-06-15

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

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.

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

Synthesis of carbasugars from aldonolactones, part III - A study on the allylic substitution of (1R,5R,8R)- and (1R,5R,8S)-8-hydroxy-2-oxabicyclo[3.3.0]oct-6-en-3-one derivatives - Preparation of (1S,2R,3R)-9-[2-hydroxy-3-(2-hydroxyethyl)cyclopent-4-en-1-yl]-9H-adenine

DEFF Research Database (Denmark)

Johansen, Steen Karsk; Lundt, Inge

2001-01-01

The palladium-catalyzed substitution of acylated (1R,5R,8R)- and (1R,SR,8S)-8-hydroxy-2-oxabicyclo[3.3.0] ones has been studied using a number of C- and N-nucleophiles, In all cases, the exo derivatives (8R) were found to be more reactive than the corresponding endo derivatives (8S). The reaction...... with these nucleophiles. Additionally, Mitsunobu substitution of (1R,5R,8R)-8-hydroxy-2-oxabicyclo[3.3.0]oct-B-en-3-one (3) with 6-chloropurine, followed by reduction of the lactone moiety and treatment with Liquid ammonia, gave the carbocyclic nucleoside (1S,2R,3R)-9-[2-hydroxy-3-(2-hydroxyethyl)cyclopent-4-en-1-yl]-9H...

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.

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

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

Directory of Open Access Journals (Sweden)

Nachiket Kapre

2011-01-01

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

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.

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

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.

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

Science.gov (United States)

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

2008-02-15

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

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

On the partition dimension of two-component graphs

Indian Academy of Sciences (India)

D O Haryeni

2017-11-17

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

Bose and Fermi walk configurations on planar graphs

International Nuclear Information System (INIS)

Arrowsmith, D K; Bhatti, F M; Essam, J W

2012-01-01

The number, f C n (H), of n-walk configurations of type C is investigated on certain two-rooted directed planar graphs H which will be always realized as plane graphs in R 2 . C may be Bose or Fermi as defined by Inui and Katori. Both types of configuration are collections of non-crossing walks which follow the directed paths between the roots of the plane graph H. In the case of configurations of Fermi type each walk may be included only once. The number f Bose n (H) is shown to be a polynomial in n of degree n max − 1 where n max is the maximum number of walks in a Fermi configuration. The coefficient of the highest power of n in this polynomial is simply related to the number of maximal Fermi walk configurations. It is also shown that n max = c(H) + 1 where c(H) is the number of finite faces on H. Extension of these results to multi-rooted graphs is also discussed. When H is the union of paths between two sites of the directed square lattice subject to various boundary conditions Kreweras showed that the number of Bose configurations is equal to the number of n-element multi-chains on segments of Young’s lattice. He expressed this number as a determinant the elements of which are polynomials in n. We evaluate this determinant by the method of LU decomposition in the case of ‘watermelon’ configurations above a wall. In this case the polynomial is a product of linear factors but on introducing a second wall the polynomial does not completely factorize but has a factor which is the number of watermelon configurations on the largest rectangular subgraph. The number of two-rooted ‘star’ configurations is found to be the product of the numbers of watermelon configurations on the three rectangular subgraphs into which it may be partitioned. (paper)

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

Molecular and crystal structure of nido-9-C5H5N-11-I-7,8-C2B9H10: supramolecular architecture via hydrogen bonding X-H...I (X = B, C)

International Nuclear Information System (INIS)

Polyanskaya, T.M.

2006-01-01

A monocrystal X-ray diffraction study of a new iodine-containing cluster compound 9-(pyridine)-11-iodo-decahydro-7,8-dicarba-nido-undecaborane [9-C 5 H 5 N-11-I-7,8-C 2 B 9 H 10 ] has been performed. Crystal data: C 7 H 15 B 9 NI, M = 337.39, monoclinic, space group P2 1 /c, unit cell parameters: a=9.348(1) A, b=11.159(1) A, c=13.442(2) A, β=98.13(1) deg, V=1388.1(5) A 3 , Z=4, d calc = 1.614 g/cm 3 , T = 295 K, F(000)=648, μ=2.276 mm -1 . The structure was solved by a direct method and refined in the full-matrix anisotropic approximation (isotropic for hydrogen atoms) to final agreement factors R 1 = 0.0254, wR 2 = 0.0454 for 2437 I hkl >2σ I from 3590 measured I hkl (an Enraf-Nonius CAD-4 diffractometer, λMoK α , graphite monochromator, θ/2θ-scanning). The molecules are joined into a supramolecular assembly by hydrogen bonds X-H...I (X = B, C) [ru

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)

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

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.

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 circumference of the square of a connected graph

DEFF Research Database (Denmark)

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

2014-01-01

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

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.

Exploring and Making Sense of Large Graphs

Science.gov (United States)

2015-08-01

WWW), Rio de Janeiro , Brazil, pages 119–130. ACM, 2013. [BYH04] Xiao Bai, Hang Yu, and Edwin R. Hancock. Graph Matching Using Spectral Embedding and...grant number DE -AC52-07NA27344, the Defense Advanced Research Projects Agency under grant number W911NF-11-C-0088, the Air Force Research Laboratory...MDL principle) visualizing. Table 3.8: Feature-based comparison of VOG with alternative approaches. So ft clu ste rin g De ns e b lo ck s St ar s Ch ai

Long non-coding RNA TUG1 inhibits apoptosis and inflammatory response in LPS-treated H9c2 cells by down-regulation of miR-29b.

Science.gov (United States)

Zhang, Haifang; Li, Hui; Ge, Ang; Guo, Enyu; Liu, Shuxia; Zhang, Lijuan

2018-05-01

Myocarditis is an important cause for cardiovascular morbidity and mortality in children and adults. The lncRNA taurine up-regulated gene 1 (TUG1) plays important roles in cell apoptosis and inflammation in tumor and liver injury. The present study aimed to investigate the role of TUG1 in LPS-injured H9c2 cells and explore the underlying molecular mechanism. H9c2 cells were stimulated with LPS to induce inflammatory injury. The expression of TUG1 was altered by transient transfections. Cell viability and apoptotic cell rates were detected by CCK-8 assay and flow cytometry assay, respectively. Inflammatory response was determined by detecting levels of inflammatory cytokines using qRT-PCR and ELISA. Furthermore, western blot analysis was conducted to assess the expression levels of core factors related with apoptosis and activations of NF-κB and JAK/STAT signaling pathways. LPS exposure reduced cell viability but enhanced cell apoptosis and inflammation in H9c2 cells. Moreover, TUG1 expression was down-regulated in LPS-injured H9c2 cells. TUG1 overexpression attenuated LPS-induced injuries in H9c2 cells, evidenced by augmented cell viability, declined apoptotic cell rates and decreased levels of pro-apoptotic factors and inflammatory cytokines. Inversely, TUG1 inhibition exerted the opposite effects. More importantly, TUG1 negatively modulated the expression of miR-29b and miR-29b mimic blocked the effect of TUG1 overexpression on cell viability, apoptosis, inflammation and inactivation of NF-κB and JAK/STAT signaling pathways in LPS-stimulated H9c2 cells. This study demonstrated that TUG1 played the anti-apoptotic and anti-inflammatory roles in LPS-injured H9c2 cells via down-regulating miR-29b and inhibiting NF-κB and JAK/STAT pathways. Copyright © 2018 Elsevier Masson SAS. All rights reserved.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

International Nuclear Information System (INIS)

Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Raab, Clemens; Wissbrock, Fabian

2014-02-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a N , a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

Energy Technology Data Exchange (ETDEWEB)

Ablinger, Jakob; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Wissbrock, Fabian [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC)

2014-02-15

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a{sup N}, a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

Energy Technology Data Exchange (ETDEWEB)

Ablinger, Jakob [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Blümlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany); Schneider, Carsten [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Wißbrock, Fabian [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany)

2014-08-15

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a{sup N},a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

International Nuclear Information System (INIS)

Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian

2014-01-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a N ,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions

Improved i-motif thermal stability by insertion of anthraquinone monomers

DEFF Research Database (Denmark)

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

2017-01-01

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

Crystal structures of double vanadates Ca9R(VO4)7. 1. R = La, Pr and Eu

International Nuclear Information System (INIS)

Belik, A.A.; Morozov, V.A.; Lazoryak, B.I.; Khasanov, S.S.

1997-01-01

Crystalline structures of Ca 9 R(VO 4 ) 7 (R = La(1), Pr(2), Eu(3)) were studied by means of the complete profile analysis. The compounds crystallize in trigonal syngony (sp.gr. R3c, Z=6) with the following parameters of the elementary cells: 1 - a=10.8987(5), c = 38.147(1) A, V = 3924.1(3) A; 2 - a 10.8808(7), c = 38.135(1) A, V = 3910.0(3) A; 3 - a = 10.8651(1), c 38.089(1) A, V = 3894.0(3) A 3 . The rare-earth element cations together with calcium population density of the rare-earth element cations in the positions changes regularly depending on their radius. In some compounds starting from La up to Eu the population density of the rare-earth element cations in M(3) position decreases, while that in M(1) and M(2) position - increases

RNA recognition motif (RRM)-containing proteins in Bombyx mori

African Journals Online (AJOL)

STORAGESEVER

2009-03-20

Mar 20, 2009 ... Recognition Motif (RRM), sometimes referred to as. RNP1, is one of the first identified domains for RNA interaction. RRM is very common ..... Apart from the RRM motif, eIF3-S9 has a Trp-Asp. (WD) repeat domain, Poly (A) ...

Structural and theoretical study of 1-[1-oxo-3-phenyl-(2-benzosulfonamide)-propyl amido] - anthracene-9,10-dione to be i-motif inhibitor

Science.gov (United States)

Vatsal, Manu; Devi, Vandna; Awasthi, Pamita

2018-04-01

The 1-[1-oxo-3-phenyl-(2-benzosulfonamide)-propyl amido] - anthracene-9,10-dione (BPAQ) an analogue of anthracenedione class of antibiotic has been synthesized. To characterize molecular functional groups FT-IR and FT-Raman spectrum were recorded and vibrational frequencies were assigned accordingly. The optimized geometrical parameters, vibrational assignments, chemical shifts and thermodynamic properties of title compound were computed by ab initio calculations at Density Functional Theory (DFT) method with 6-31G(d,p) as basis set. The calculated harmonic vibrational frequencies of molecule were then analysed in comparison to experimental FT-IR and Raman spectrum. Gauge independent atomic orbital (GIAO) method was used for determining, (1H) and carbon (13C) nuclear magnetic resonance (NMR) spectra of the molecule. Molecular parameters were calculated along with its periodic boundary conditions calculation (PBC) analysis supported by X-ray diffraction studies. The frontier molecular orbital (HOMO, LUMO) analysis describes charge distribution and stability of the molecule which concluded that nucleophilic substitution is more preferred and the mullikan charge analysis also confirmed the same. Further the title compound showed an inhibitory action at d(TCCCCC), an intermolecular i-motif sequence, hence molecular docking study suggested the inhibitory activity of the compound at these junction.

Peripheral metabolism of (R)-[{sup 11}C]verapamil in epilepsy patients

Energy Technology Data Exchange (ETDEWEB)

Abrahim, Aiman; Langer, Oliver [Medical University of Vienna, Department of Clinical Pharmacology, Division of Clinical Pharmacokinetics, Vienna (Austria); Austrian Research Centers GmbH - ARC, Department of Radiopharmaceuticals, Seibersdorf (Austria); Luurtsema, Gert; Lubberink, Mark; Lammertsma, Adriaan A. [VU University Medical Centre, Department of Nuclear Medicine and PET Research, Amsterdam (Netherlands); Bauer, Martin; Joukhadar, Christian; Mueller, Markus [Medical University of Vienna, Department of Clinical Pharmacology, Division of Clinical Pharmacokinetics, Vienna (Austria); Karch, Rudolf [Medical University of Vienna, Department of Medical Computer Sciences, Vienna (Austria); Pataraia, Ekaterina; Baumgartner, Christoph [Medical University of Vienna, Department of Neurology, Vienna (Austria); Kletter, Kurt [Medical University of Vienna, Department of Nuclear Medicine, Vienna (Austria)

2008-01-15

(R)-[{sup 11}C]verapamil is a new PET tracer for P-glycoprotein-mediated transport at the blood-brain barrier. For kinetic analysis of (R)-[{sup 11}C]verapamil PET data the measurement of a metabolite-corrected arterial input function is required. The aim of this study was to assess peripheral (R)-[{sup 11}C]verapamil metabolism in patients with temporal lobe epilepsy and compare these data with previously reported data from healthy volunteers. Arterial blood samples were collected from eight patients undergoing (R)-[{sup 11}C]verapamil PET and selected samples were analysed for radiolabelled metabolites of (R)-[{sup 11}C]verapamil by using an assay that measures polar N-demethylation metabolites by solid-phase extraction and lipophilic N-dealkylation metabolites by HPLC. Peripheral metabolism of (R)-[{sup 11}C]verapamil was significantly faster in patients compared to healthy volunteers (AUC of (R)-[{sup 11}C]verapamil fraction in plasma: 29.4 {+-} 3.9 min for patients versus 40.8 {+-} 5.0 min for healthy volunteers; p < 0.0005, Student's t-test), which resulted in lower (R)-[{sup 11}C]verapamil plasma concentrations (AUC of (R)-[{sup 11}C]verapamil concentration, normalised to injected dose per body weight: 25.5 {+-} 2.1 min for patients and 30.5 {+-} 5.9 min for healthy volunteers; p = 0.038). Faster metabolism appeared to be mainly due to increased N-demethylation as the polar [{sup 11}C]metabolite fraction was up to two-fold greater in patients. Faster metabolism of (R)-[{sup 11}C]verapamil in epilepsy patients may be caused by hepatic cytochrome P450 enzyme induction by antiepileptic drugs. Based on these data caution is warranted when using an averaged arterial input function derived from healthy volunteers for the analysis of patient data. Moreover, our data illustrate how antiepileptic drugs may decrease serum levels of concomitant medication, which may eventually lead to a loss of therapeutic efficacy. (orig.)

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.

Pixels to Graphs by Associative Embedding

KAUST Repository

Newell, Alejandro

2017-06-22

Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional neural network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them together. We benchmark on the Visual Genome dataset, and report a Recall@50 of 9.7% compared to the prior state-of-the-art at 3.4%, a nearly threefold improvement on the challenging task of scene graph generation.

Cortical Morphogenesis during Embryonic Development Is Regulated by miR-34c and miR-204

DEFF Research Database (Denmark)

Veno, Morten T.; Veno, Susanne T.; Rehberg, Kati

2017-01-01

The porcine brain closely resembles the human brain in aspects such as development and morphology. Temporal miRNA profiling in the developing embryonic porcine cortex revealed a distinct set of miRNAs, including miR-34c and miR-204, which exhibited a highly specific expression profile across...

C r C =

Indian Academy of Sciences (India)

Administrator

C r. C. = CTPPY: concentration of TPPY; CAuNPs: concentration of Au NPs. The concentration of the Au NPs is calculated as follows: (1) The weight of Au (WAu) produced from the complete reduction of HAuCl4 is calculated by multiplying the mole of added HAuCl4 (weight of added. HAuCl4·4H2O divided by molecular ...

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.

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

Graphs, groups and surfaces

CERN Document Server

White, AT

1985-01-01

The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.

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\

Discovery of novel interacting partners of PSMD9, a proteasomal chaperone: Role of an Atypical and versatile PDZ-domain motif interaction and identification of putative functional modules

Directory of Open Access Journals (Sweden)

Nikhil Sangith

2014-01-01

Full Text Available PSMD9 (Proteasome Macropain non-ATPase subunit 9, a proteasomal assembly chaperone, harbors an uncharacterized PDZ-like domain. Here we report the identification of five novel interacting partners of PSMD9 and provide the first glimpse at the structure of the PDZ-domain, including the molecular details of the interaction. We based our strategy on two propositions: (a proteins with conserved C-termini may share common functions and (b PDZ domains interact with C-terminal residues of proteins. Screening of C-terminal peptides followed by interactions using full-length recombinant proteins, we discovered hnRNPA1 (an RNA binding protein, S14 (a ribosomal protein, CSH1 (a growth hormone, E12 (a transcription factor and IL6 receptor as novel PSMD9-interacting partners. Through multiple techniques and structural insights, we clearly demonstrate for the first time that human PDZ domain interacts with the predicted Short Linear Sequence Motif (SLIM at the C-termini of the client proteins. These interactions are also recapitulated in mammalian cells. Together, these results are suggestive of the role of PSMD9 in transcriptional regulation, mRNA processing and editing, hormone and receptor activity and protein translation. Our proof-of-principle experiments endorse a novel and quick method for the identification of putative interacting partners of similar PDZ-domain proteins from the proteome and for discovering novel functions.

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

Science.gov (United States)

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

2017-12-01

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

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 .

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)

Araloside C Prevents Hypoxia/Reoxygenation-Induced Endoplasmic Reticulum Stress via Increasing Heat Shock Protein 90 in H9c2 Cardiomyocytes

Directory of Open Access Journals (Sweden)

Yuyang Du

2018-04-01

Full Text Available Araloside C (AsC is a cardioprotective triterpenoid compound that is mainly isolated from Aralia elata. This study aims to determine the effects of AsC on hypoxia-reoxygenation (H/R-induced apoptosis in H9c2 cardiomyocytes and its underlying mechanisms. Results demonstrated that pretreatment with AsC (12.5 μM for 12 h significantly suppressed the H/R injury in H9c2 cardiomyocytes, including improving cell viability, attenuating the LDH leakage and preventing cardiomyocyte apoptosis. AsC also inhibited H/R-induced ER stress by reducing the activation of ER stress pathways (PERK/eIF2α and ATF6, and decreasing the expression of ER stress-related apoptotic proteins (CHOP and caspase-12. Moreover, AsC greatly improved the expression level of HSP90 compared with that in the H/R group. The use of HSP90 inhibitor 17-AAG and HSP90 siRNA blocked the above suppression effect of AsC on ER stress-related apoptosis caused by H/R. Taken together, AsC could reduce H/R-induced apoptosis possibly because it attenuates ER stress-dependent apoptotic pathways by increasing HSP90 expression.

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

Science.gov (United States)

Agasthi, P.; Parvathi, N.

2018-04-01

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

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

Science.gov (United States)

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

2017-02-01

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

Triadic motifs in the dependence networks of virtual societies

Science.gov (United States)

Xie, Wen-Jie; Li, Ming-Xia; Jiang, Zhi-Qiang; Zhou, Wei-Xing

2014-06-01

In friendship networks, individuals have different numbers of friends, and the closeness or intimacy between an individual and her friends is heterogeneous. Using a statistical filtering method to identify relationships about who depends on whom, we construct dependence networks (which are directed) from weighted friendship networks of avatars in more than two hundred virtual societies of a massively multiplayer online role-playing game (MMORPG). We investigate the evolution of triadic motifs in dependence networks. Several metrics show that the virtual societies evolved through a transient stage in the first two to three weeks and reached a relatively stable stage. We find that the unidirectional loop motif (M9) is underrepresented and does not appear, open motifs are also underrepresented, while other close motifs are overrepresented. We also find that, for most motifs, the overall level difference of the three avatars in the same motif is significantly lower than average, whereas the sum of ranks is only slightly larger than average. Our findings show that avatars' social status plays an important role in the formation of triadic motifs.

Triadic motifs in the dependence networks of virtual societies.

Science.gov (United States)

Xie, Wen-Jie; Li, Ming-Xia; Jiang, Zhi-Qiang; Zhou, Wei-Xing

2014-06-10

In friendship networks, individuals have different numbers of friends, and the closeness or intimacy between an individual and her friends is heterogeneous. Using a statistical filtering method to identify relationships about who depends on whom, we construct dependence networks (which are directed) from weighted friendship networks of avatars in more than two hundred virtual societies of a massively multiplayer online role-playing game (MMORPG). We investigate the evolution of triadic motifs in dependence networks. Several metrics show that the virtual societies evolved through a transient stage in the first two to three weeks and reached a relatively stable stage. We find that the unidirectional loop motif (M9) is underrepresented and does not appear, open motifs are also underrepresented, while other close motifs are overrepresented. We also find that, for most motifs, the overall level difference of the three avatars in the same motif is significantly lower than average, whereas the sum of ranks is only slightly larger than average. Our findings show that avatars' social status plays an important role in the formation of triadic motifs.

The color space of a graph

DEFF Research Database (Denmark)

Jensen, T.R.; Thomassen, Carsten

2000-01-01

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

A model of language inflection graphs

Science.gov (United States)

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

2014-01-01

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

Preliminary structural studies of the transcriptional regulator CmeR from Campylobacter jejuni

Energy Technology Data Exchange (ETDEWEB)

Su, Chih-Chia [Department of Biochemistry, Biophysics and Molecular Biology, Iowa State University, Ames, IA 50011 (United States); Shi, Feng [Department of Veterinary Microbiology, College of Veterinary Medicine, Iowa State University, Ames, IA 50011 (United States); Gu, Ruoyu; Li, Ming [Department of Physics and Astronomy, Iowa State University, Ames, IA 50011 (United States); McDermott, Gerry [Department of Anatomy, School of Medicine, University of California, San Francisco, CA 94143 (United States); Yu, Edward W., E-mail: ewyu@iastate.edu [Department of Biochemistry, Biophysics and Molecular Biology, Iowa State University, Ames, IA 50011 (United States); Department of Physics and Astronomy, Iowa State University, Ames, IA 50011 (United States); Zhang, Qijing [Department of Veterinary Microbiology, College of Veterinary Medicine, Iowa State University, Ames, IA 50011 (United States); Department of Biochemistry, Biophysics and Molecular Biology, Iowa State University, Ames, IA 50011 (United States)

2007-01-01

The transcriptional regulator CmeR from C. jejuni has been purified and crystallized and X-ray diffraction data have been collected to a resolution of 2.2 Å. In Campylobacter jejuni, a Gram-negative bacterial pathogen causing gastroenteritis in humans, the CmeR regulatory protein controls transcription of the multidrug transporter gene operon cmeABC. CmeR belongs to the TetR family of transcriptional regulators. The 210-residue CmeR consists of two functional motifs: an N-terminal DNA-binding domain and a C-terminal ligand-binding domain. It is predicted that the DNA-binding domain interacts directly with target promoters, while the C-terminal motif interacts with inducing ligands (such as bile salts). As an initial step towards confirming this structural model, recombinant CmeR protein containing a 6×His tag at the N-terminus was crystallized. Crystals of ligand-free CmeR belonged to space group P2{sub 1}2{sub 1}2, with unit-cell parameters a = 37.4, b = 57.6, c = 93.3 Å. Diffraction was observed to at least 2.2 Å at 100 K. Analysis of the detailed CmeR structure is currently in progress.

A tryptophan-rich motif in the human parainfluenza virus type 2 V protein is critical for the blockade of toll-like receptor 7 (TLR7)- and TLR9-dependent signaling.

Science.gov (United States)

Kitagawa, Yoshinori; Yamaguchi, Mayu; Zhou, Min; Komatsu, Takayuki; Nishio, Machiko; Sugiyama, Tsuyoshi; Takeuchi, Kenji; Itoh, Masae; Gotoh, Bin

2011-05-01

Plasmacytoid dendritic cells (pDCs) do not produce alpha interferon (IFN-α) unless viruses cause a systemic infection or overcome the first-line defense provided by conventional DCs and macrophages. We show here that even paramyxoviruses, whose infections are restricted to the respiratory tract, have a V protein able to prevent Toll-like receptor 7 (TLR7)- and TLR9-dependent IFN-α induction specific to pDCs. Mutational analysis of human parainfluenza virus type 2 demonstrates that the second Trp residue of the Trp-rich motif (Trp-X(3)-Trp-X(9)-Trp) in the C-terminal domain unique to V, a determinant for IRF7 binding, is critical for the blockade of TLR7/9-dependent signaling.

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.

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

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.

Diisopropylammonium methanesulfonate

Directory of Open Access Journals (Sweden)

Guido J. Reiss

2011-08-01

Full Text Available The title molecular salt, C6H16N+·CH3SO3−, has been determined at 150 K. Two diisopropylammonium cations (dipH and two anions form N—H...O hydrogen-bonded cyclic dimers lying around centers of symmetry. Only two of the three O atoms of the methanesulfonate anion are involved in hydrogen bonding, resulting in slightly longer S—O bond lengths. The title structure represents an example of a sulfonate anion that is part of a hydrogen-bonding R44(12 graph-set motif, which is well known for related dipH acetates. Additionally, the Raman and the IR spectroscopic data for the title compound are presented.

Evaluation of the toxicity of Streptomyces aburaviensis (R9) towards various agricultural pests

Science.gov (United States)

The culture filtrate fraction extracted with dichloromethane from Streptomyces aburaviensis -R9 strain grown on glucose-peptone-molasses (GPM) broth was bioassayed for its effect on phytopathogenic fungi (Colletotrichum acutatum, C. fragariae, C. gloeosoprioids, Botrytis cinerea, Fusarium oxysporum,...

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

Directory of Open Access Journals (Sweden)

Launey Thomas

2011-06-01

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

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

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.

Enantioselective synthesis of C{sub 9}-C{sub 1}3 fragment of erythromycin B; Sintesis enantioselectiva del fragmento C{sub 9}-C{sub 1}3 de la eritromicina B

Energy Technology Data Exchange (ETDEWEB)

Dominguez, E.; Carretero, J.C. [Departamento de Quimica Organica, Universidad Autonoma, Madrid (Spain)

1994-12-31

A stereo controlled synthesis of the enantiomerically pure C{sub 9}-C{sub 1}3 fragment of erythromycin B is described. The process takes place in 15 steps from (R)-phenylsulfonyl p-tolylsulfinyl methane and butyraldehyde (16% overall yield). The key steps, corresponding to the formation of the chiral centers, are based on the iterative synthesis of gamma-hydroxivinylsulfones and further syb-sterereoselective addition of MeLi to their protected derivatives. 8 refs.

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.

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

47 CFR 95.201 - (R/C Rule 1) What is the Radio Control (R/C) Radio Service?

Science.gov (United States)

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false (R/C Rule 1) What is the Radio Control (R/C...) SAFETY AND SPECIAL RADIO SERVICES PERSONAL RADIO SERVICES Radio Control (R/C) Radio Service General Provisions § 95.201 (R/C Rule 1) What is the Radio Control (R/C) Radio Service? The R/C Service is a private...

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.

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

Directory of Open Access Journals (Sweden)

U. H. Patel

2013-06-01

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

Low-Rank Matrix Factorization With Adaptive Graph Regularizer.

Science.gov (United States)

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

2016-05-01

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

Determining X-chains in graph states

International Nuclear Information System (INIS)

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

2016-01-01

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

Applications of Graph Spectral Techniques to Water Distribution Network Management

Directory of Open Access Journals (Sweden)

Armando di Nardo

2018-01-01

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

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

Crystal structure of (1S,3R,8R,10S-2,2-dichloro-10-hydroxy-3,7,7,10-tetramethyltricyclo[6.4.0.01,3]dodecan-9-one

Directory of Open Access Journals (Sweden)

Ahmed Benzalim

2016-05-01

Full Text Available The asymmetric unit of the title compound, C16H24Cl2O2, contains two independent molecules (A and B which are built from three fused rings, viz. a seven-membered heptane ring, a six-membered cyclohexyl ring bearing a ketone and an alcohol group, and a cyclopropane ring bearing two Cl atoms. In the crystal, the two molecules are linked via two O—H...O hydrogen bonds, forming an A–B dimer with an R22(10 ring motif. The A molecules of these dimers are linked via a C—H...O hydrogen bond, forming chains propagating along the a-axis direction. Both molecules have the same absolute configuration, i.e. 1S,3R,8R,10S, which is based on the synthetic pathway and further confirmed by resonant scattering [Flack parameter = 0.03 (5].

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

Science.gov (United States)

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

2018-04-01

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

Evaporation of R407C and R410A in a horizontal herringbone microfin tube: heat transfer and pressure drop

Energy Technology Data Exchange (ETDEWEB)

Wellsandt, S; Vamling, L [Chalmers University of Technology, Gothenburg (Sweden). Department of Chemical Engineering and Environmental Science, Heat and Power Technology

2005-09-01

An experimental investigation of in-tube evaporation of R410A and R407C has been carried out for a 4 m long herringbone microfin tube with an outer diameter of 9.53 mm. Measured local heat transfer coefficients and pressure losses are reported for evaporation temperatures for R410A and R407C between -2.2 and 9.5 {sup o}C and between -5.5 and 13.8 {sup o}C, respectively. Mass flow rates between 162 and 366 kg m{sup -2} s{sup -1} have been investigated. Results from this work are compared to R134a data from an earlier work by the present authors, and also to predicted values from some available helical microfin correlations. Compared to R134a data, heat transfer coefficients for the investigated mixtures are generally lower, especially at low mass flow rates. No major effect of heat flux on heat transfer coefficients was found, with the exception of the high quality region. Predicted heat transfer coefficients from helical microfin correlations strongly overpredict the present data. Global pressure losses are predicted well, even though local deviations are found. (author)

Measuring Two-Event Structural Correlations on Graphs

Science.gov (United States)

2012-08-01

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

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

Coloring geographical threshold graphs

Energy Technology Data Exchange (ETDEWEB)

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

2008-01-01

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

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

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

Directory of Open Access Journals (Sweden)

Julia Bender

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

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

Some results on square-free colorings of graphs

DEFF Research Database (Denmark)

Barat, Janos

2004-01-01

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

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

Directory of Open Access Journals (Sweden)

Jean Chamberlain Chedjou

2015-01-01

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

System performance with R407A, R407B, R407C compared to R22

DEFF Research Database (Denmark)

Knudsen, Hans Jørgen Høgaard

1997-01-01

both the cooling capacity and COP are smaller then the cooling capacity and COP with R22. The cooling capacity for R407A and R407B is lower than the capacity for R22 for brine temperatures less than 0 C and higher then the cooling capacity for R22 for brine temperatures higher than 0 C. The COP for R......407A and R407B er lower than the COP for R22.The volumetric and isentropic efficiency of the compressor are with mixture higher than the volumetric and isentropic efficiency with R22.......The article presents the results obtained by substituting R22 with mixture of R32/R125/R134A (R407A, R407B and R407C) in an existing refrigeration plant. Cooling capacity, coefficient of performance and heat transfer coefficient in the evaporator have been measured.The results show that for R407C...

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

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

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.

System performance with R407A, R407B, R407C compared to R22

DEFF Research Database (Denmark)

Knudsen, Hans Jørgen Høgaard

1997-01-01

been determined.The results show that for R407C both the cooling capacity and the COP are smaller than the cooling capacity and COP for R22. The cooling capacity for R407A and for R407B is lower then the cooling capacity for R22 for brine temperatures less than 0 C and higher than the capacity for R22...... for brine temperatures higher than 0 C. The COP for R407A and 407B are lower than the COP for R22.The volumetriv and isentropic efficiency of the compressor are with mixtures higher than the volumetric and isentropic efficiency with R22.......The paper presents the results obtained by substituting R22 with mixtures of R32/R124/134a (R407A, R407B and R407C) in an existing refrigeration plant. The cooling water flow and cooling water inlet temperature together with the brine flow and brine inlet temperature have been kept on a value...

Curcumin inhibits oral squamous cell carcinoma SCC-9 cells proliferation by regulating miR-9 expression

Energy Technology Data Exchange (ETDEWEB)

Xiao, Can [Department of Occupational Medicine and Environmental Health, School of Public Health, Soochow University, Suzhou 215123 (China); Department of Stomatology, The First Affiliated Hospital of Soochow University, Suzhou 215006 (China); Wang, Lili; Zhu, Lifang [Department of Stomatology, The First Affiliated Hospital of Soochow University, Suzhou 215006 (China); Zhang, Chenping, E-mail: zhang_cping@163.com [Department of Head and Neck Tumors, Shanghai Ninth People’s Hospital Affiliated Shanghai JiaoTong University School of Medicine, Shanghai 200011 (China); Zhou, Jianhua [Department of Occupational Medicine and Environmental Health, School of Public Health, Soochow University, Suzhou 215123 (China)

2014-11-28

Highlights: • miR-9 expression level was significantly decreased in OSCC tissues. • Curcumin significantly inhibited SCC-9 cells proliferation. • miR-9 mediates the inhibition of SCC-9 proliferation by curcumin. • Curcumin suppresses Wnt/β-catenin signaling in SCC-9 cells. • miR-9 mediates the suppression of Wnt/β-catenin signaling by curcumin. - Abstract: Curcumin, a phytochemical derived from the rhizome of Curcuma longa, has shown anticancer effects against a variety of tumors. In the present study, we investigated the effects of curcumin on the miR-9 expression in oral squamous cell carcinoma (OSCC) and explored the potential relationships between miR-9 and Wnt/β-catenin pathway in curcumin-mediated OSCC inhibition in vitro. As the results shown, the expression levels of miR-9 were significantly lower in clinical OSCC specimens than those in the adjacent non-tumor tissues. Furthermore, our results indicated that curcumin inhibited OSCC cells (SCC-9 cells) proliferation through up-regulating miR-9 expression, and suppressing Wnt/β-catenin signaling by increasing the expression levels of the GSK-3β, phosphorylated GSK-3β and β-catenin, and decreasing the cyclin D1 level. Additionally, the up-regulation of miR-9 by curcumin in SCC-9 cells was significantly inhibited by delivering anti-miR-9 but not control oligonucleotides. Downregulation of miR-9 by anti-miR-9 not only attenuated the growth-suppressive effects of curcumin on SCC-9 cells, but also re-activated Wnt/β-catenin signaling that was inhibited by curcumin. Therefore, our findings would provide a new insight into the use of curcumin against OSCC in future.

Curcumin inhibits oral squamous cell carcinoma SCC-9 cells proliferation by regulating miR-9 expression

International Nuclear Information System (INIS)

Xiao, Can; Wang, Lili; Zhu, Lifang; Zhang, Chenping; Zhou, Jianhua

2014-01-01

Highlights: • miR-9 expression level was significantly decreased in OSCC tissues. • Curcumin significantly inhibited SCC-9 cells proliferation. • miR-9 mediates the inhibition of SCC-9 proliferation by curcumin. • Curcumin suppresses Wnt/β-catenin signaling in SCC-9 cells. • miR-9 mediates the suppression of Wnt/β-catenin signaling by curcumin. - Abstract: Curcumin, a phytochemical derived from the rhizome of Curcuma longa, has shown anticancer effects against a variety of tumors. In the present study, we investigated the effects of curcumin on the miR-9 expression in oral squamous cell carcinoma (OSCC) and explored the potential relationships between miR-9 and Wnt/β-catenin pathway in curcumin-mediated OSCC inhibition in vitro. As the results shown, the expression levels of miR-9 were significantly lower in clinical OSCC specimens than those in the adjacent non-tumor tissues. Furthermore, our results indicated that curcumin inhibited OSCC cells (SCC-9 cells) proliferation through up-regulating miR-9 expression, and suppressing Wnt/β-catenin signaling by increasing the expression levels of the GSK-3β, phosphorylated GSK-3β and β-catenin, and decreasing the cyclin D1 level. Additionally, the up-regulation of miR-9 by curcumin in SCC-9 cells was significantly inhibited by delivering anti-miR-9 but not control oligonucleotides. Downregulation of miR-9 by anti-miR-9 not only attenuated the growth-suppressive effects of curcumin on SCC-9 cells, but also re-activated Wnt/β-catenin signaling that was inhibited by curcumin. Therefore, our findings would provide a new insight into the use of curcumin against OSCC in future

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)

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.

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.

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.

Treatment-Induced Viral Cure of Hepatitis C Virus-Infected Patients Involves a Dynamic Interplay among three Important Molecular Players in Lipid Homeostasis: Circulating microRNA (miR)-24, miR-223, and Proprotein Convertase Subtilisin/Kexin Type 9.

Science.gov (United States)

Hyrina, Anastasia; Olmstead, Andrea D; Steven, Paul; Krajden, Mel; Tam, Edward; Jean, François

2017-09-01

In patients with chronic hepatitis C virus (HCV) infection, viral hijacking of the host-cell biosynthetic pathways is associated with altered lipid metabolism, which contributes to disease progression and may influence antiviral response. We investigated the molecular interplay among four key regulators of lipid homeostasis [microRNA (miR)-122, miR-24, miR-223, and proprotein convertase subtilisin/kexin type 9 (PCSK9)] in HCV-infected patients (n=72) who achieved a treatment-based viral cure after interferon-based therapy with first-generation direct-acting antivirals. Real-time PCR was used to quantify microRNA plasma levels, and ELISA assays were used to determine plasma concentrations of PCSK9. We report that levels of miR-24 and miR-223 significantly increased in patients achieving sustained virologic response (SVR), whereas the levels of miR-122, a liver-specific cofactor for HCV infection, decreased in these patients. PCSK9 concentrations were significantly increased in SVRs, suggesting that PCSK9 may help impede viral infection. The modulatory effect of PCSK9 on HCV infection was also demonstrated in the context of HCV-infected Huh-7.5.1 cells employing recombinant human PCSK9 mutants. Together, these results provide insights into a novel coordinated interplay among three important molecular players in lipid homeostasis - circulating miR-24, miR-223 and PCSK9 - whose regulation is affected by HCV infection and treatment-based viral cure. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

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

Directory of Open Access Journals (Sweden)

Chattopadhyay Santanu

2012-05-01

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

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

Quantum Graph Analysis

Energy Technology Data Exchange (ETDEWEB)

Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2016-01-01

In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

Formation of closo-rhodacarboranes with the η2,η3-(CH2=CHC5H6) ligand in the reaction of μ-dichloro-bis[(η4-norbornadiene)rhodium] with nido-dicarbaundecaborates [K][nido-7-R1-8-R2-7,8-C2B9H10

International Nuclear Information System (INIS)

Safronov, A.V.; Sokolova, M.N.; Vorontsov, E.V.; Petrovskij, P.V.; Barakovskaya, I.G.; Chizhevskij, I.T.

2004-01-01

New closo-(η 2 ,η 3 -(4-vinylcyclopentene-3-yl)rhodacarboranes were prepared by reaction of the complex [(η 4 -C 7 H 8 )RhCl] 2 (C 7 H 8 -norbornadiene) with salts of substituted nido-dicarbaundecaborates [K][nido-7-R 1 -8-R 2 -7,8-C 2 B 9 H 10 ] (R 1 =R 2 =H (a); R = R 2 =Me (b); R 1 , R 2 =1',2'-(CH 2 ) 2 C 6 H 4 (c); R 1 =Me, R 2 =Ph (d) in CH 2 Cl 2 . The structure of the compounds prepared in solution was studied by the method of multinuclear NMR spectroscopy. A probable mechanism of the norbornadiene ligand regrouping was suggested [ru