Results 61 to 70 of about 1,263,669 (205)

Edge connectivity in directed graphs.

open access: yes, 2015
Edge connectivity in directed graphs.
Francis Y. L. Chin (668195)   +5 more
core   +1 more source

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

open access: yesMolecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura   +19 more
wiley   +1 more source

Scalable Graph Convolutional Networks With Fast Localized Spectral Filter for Directed Graphs

open access: yesIEEE Access, 2020
Graph convolutional neural netwoks (GCNNs) have been emerged to handle graph-structured data in recent years. Most existing GCNNs are either spatial approaches working on neighborhood of each node, or spectral approaches based on graph Laplacian ...
Chensheng Li   +4 more
doaj   +1 more source

Constructing Structural VAR Models with Conditional Independence Graphs [PDF]

open access: yes
In this paper graphical modelling is used to select a sparse structure for a multivariate time series model of New Zealand interest rates. In particular, we consider a recursive structural vector autoregressions that can subsequently be described ...
Granville Tunnicliffe Wilson   +2 more
core  

Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining

open access: yesMolecular Oncology, EarlyView.
IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis   +3 more
wiley   +1 more source

Unordered Love in infinite directed graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1992
A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj   +1 more source

Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]

open access: yesTheoretiCS
The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut   +2 more
doaj   +1 more source

Finding novel vulnerabilities of hypomorphic BRCA1 alleles

open access: yesMolecular Oncology, EarlyView.
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder   +10 more
wiley   +1 more source

On the Graph Isomorphism Completeness of Directed and Multidirected Graphs

open access: yesMathematics
The category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy