Results 71 to 80 of about 329,714 (296)
The complexity of signed graph and edge-coloured graph homomorphisms
We study homomorphism problems of signed graphs from a computational point of view. A signed graph $(G,\Sigma)$ is a graph $G$ where each edge is given a sign, positive or negative; $\Sigma\subseteq E(G)$ denotes the set of negative edges.
Brewster, Richard C. +3 more
core +1 more source
The pan‐HDAC inhibitor belinostat increases the expression of the pro‐apoptotic proteins Bim, Puma, and Noxa and induces apoptosis in ovarian cancer cell lines and patient‐derived tumor organoids when used at high concentrations. Moreover, inhibiting the anti‐apoptotic proteins Bcl‐xL or Mcl‐1 sensitizes these preclinical models to the cytotoxic effect
Cécilia Thomine +10 more
wiley +1 more source
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
Consistency in the Naturally Vertex-Signed Line Graph of a Signed Graph [PDF]
A signed graph is a graph whose edges are signed. In a vertex-signed graph the vertices are signed. The latter is called consistent if the product of signs in every circle is positive. The line graph of a signed graph is naturally vertex-signed. Based on a characterization by Acharya, Acharya, and Sinha in 2009, we give constructions for the signed ...
openaire +3 more sources
Overexpression of CHRDL2 in colon cancer cells makes them more stem‐like and resistant to chemo‐ and radiotherapy. CHRDL2‐high cells have upregulation of the WNT pathway, genes involved in the DNA damage response (DDR) pathway and epithelial‐to‐mesenchymal transition (EMT). This leads to quicker repair of damaged DNA and more cell migration.
Eloise Clarkson, Annabelle Lewis
wiley +1 more source
Edge-Dual Graph Preserving Sign Prediction for Signed Social Networks
Though existing works of sign prediction have reasonable prediction performances, they suffer from the data sparseness problem, especially for the negative link prediction.
Weiwei Yuan +3 more
doaj +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source
Laplacian Spectral Characterization of Signed Sun Graphs
A sun SGn is a graph of order 2n consisting of a cycle Cn, n ≥ 3, to each vertex of it a pendant edge is attached. In this paper, we prove that unbalanced signed sun graphs are determined by their Laplacian spectra.
Fatemah Motialah +1 more
doaj +1 more source
Analysis of treatment‐naïve high‐grade serous ovarian carcinoma (HGSOC) and control tissues for ERVs, LINE‐1 (L1), inflammation, and immune checkpoints identified five clusters with diverse patient recurrence‐free survivals. An inflammation score was calculated and correlated with retroelement expression, where one novel cluster (Triple‐I) with high ...
Laura Glossner +6 more
wiley +1 more source
The common minimal dominating signed graph [PDF]
In this paper, we define the common minimal dominating signedgraph of a given signed graph and offer a structuralcharacterization of common minimal dominating signed graphs. Inthe sequel, we also obtained switching equivalencecharacterizations: $overline{
P. Siva Reddy, B. Prashanth
doaj

