Results 91 to 100 of about 1,255,445 (300)
On the Total Weight of Weighted Matchings of Segment Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 We study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by Vauchassade de Chaumont and Viennot and, more recently, investigated by Kim and Zeng. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight.
Stoll, Thomas, Zeng, Jiang
openaire +3 more sources
USP7 inhibits FOXO1 activity in chronic lymphocytic leukaemia cells enhancing cell survival
Molecular Oncology, EarlyView.CLL cells rely on BCR‐mediated signalling for survival and proliferation in part through suppression of FOXO1. FOXO1 activity is regulated by a plethora of post‐translational modifications including phosphorylation and ubiquitination. We demonstrated that dual inhibition of BCR signalling and the deubiquitinase USP7 activates FOXO1, modulating its ...
Hassan N.B. Almuhanna +8 more
wiley +1 more source
Molecular Oncology, EarlyView.Enterotoxigenic Bacteroides fragilis is a gut bacterium linked to bowel cancer. We propose that its toxin acts along two routes: at the cell surface, cutting the adhesion protein E‐cadherin and triggering inflammation; and inside the cell, delivered by bacterial vesicles, switching on NOD1 and cancer stem cell programs.
Kangchan Choi +2 more
wiley +1 more source
Weighted Graph-Based Two-Sample Test via Empirical Likelihood
MathematicsIn network data analysis, one of the important problems is determining if two collections of networks are drawn from the same distribution. This problem can be modeled in the framework of two-sample hypothesis testing.
Xiaofeng Zhao, Mingao Yuan
doaj +1 more source
On the Additively Weighted Harary Index of Some Composite Graphs
Mathematics, 2017 The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. The additively weighted Harary index H A ( G ) is a modification of the Harary index in which the contributions of vertex ...
Behrooz Khosravi, Elnaz Ramezani
doaj +1 more source
Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core
A note on maximally weighted graph theoretic facilities design planning [PDF]
, 2002 This note explores the significance of John and Hammond contributions in solving the facilities design problem using graph theory concepts. The note suggests arranging vertices of the constructed graph in a one-dimensional array referred to as a spinal ...
Al-Hakim, Latif
core +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Reconstruction of Weighted Graphs by their Spectrum
European Journal of Combinatorics, 2000 A weighted graph \(G\) is a pair \((A,M)\) where \(A\) and \( M\) are two matrices with \(A_{ii}=0\) and \(M\) is real diagonal. If the mass coefficients \(m_i\) are equal to 1, then \(G\) is a simple graph. If \(m_i >0\) and \(A_{ij} \geq 0\), the weighted graph is a model for a molecule or, alternatively, a discrete model of an inhomogeneous drum ...
Lorenz Halbeisen, Norbert Hungerbühler
openaire +2 more sources
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core