Results 31 to 40 of about 166,475 (217)
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source
The Ceresa period from tropical homology
The Jacobian of a very general complex algebraic curve of genus at least 3 contains an algebraic cycle called the Ceresa cycle that is homologically trivial but algebraically nontrivial.
Caelan Ritter
doaj +1 more source
Faster parameterized algorithms for modification problems to minor-closed classes [PDF]
Let ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$.
Laure Morelle +3 more
doaj +1 more source
Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena +15 more
wiley +1 more source
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
The Ceresa class and tropical curves of hyperelliptic type
We define a new algebraic invariant of a graph G called the Ceresa–Zharkov class and show that it is trivial if and only if G is of hyperelliptic type, equivalently, G does not have as a minor the complete graph on four vertices or the loop of three ...
Daniel Corey, Wanlin Li
doaj +1 more source
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly [PDF]
The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm ...
Laurent Beaudou +6 more
doaj +1 more source
Determination of the Plasma Density in a Plasma Antenna Based on Image Analysis and LIVPD Graphs
This paper introduces an innovative method for quantitatively determining plasma density in plasma columns, with particular applicability to reconfigurable antennas.
Mohammad-Reza Dorbin +3 more
doaj +1 more source
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
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
Defining Recursive Predicates in Graph Orders [PDF]
We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary.
Ramanathan S. Thinniyam
doaj +1 more source

