Results 61 to 70 of about 3,671,469 (355)
A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Graph isomorphism completeness for trapezoid graphs
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of ...
Takaoka, Asahi
core +1 more source
Claw-free graphs. III. Circular interval graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chudnovsky, Maria, Seymour, Paul
openaire +2 more sources
Exact Algorithms for Intervalizing Colored Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, Hans L. +1 more
openaire +6 more sources
In this exploratory study, we investigated the relationship between the gut microbiota and outcome in patients with metastatic hormone receptor‐positive breast cancer, treated in a randomized clinical trial with chemotherapy alone or chemotherapy in combination with immune checkpoint blockade.
Andreas Ullern +7 more
wiley +1 more source
Dombi Interval Valued Neutrosophic Graph and its Role in Traffic Control Management [PDF]
An advantage of dealing indeterminacy is possible only with Neutrosophic Sets. Graph theory plays a vital role in the field of networking. If uncertainty exist in the set of vertices and edge then that can be dealt by fuzzy graphs in any application and ...
D. Nagarajan +3 more
doaj +1 more source
Precoloring extension. I. Interval graphs [PDF]
The precoloring extension problem is defined as follows: given an integer \(k\geq 2\), a graph \(G=(V,E)\) with \(| V|\geq k\), a vertex-subest \(W\subseteq V\), and a proper \(k\)-coloring of the subgraph of \(G\) induced by \(W\), can this \(k\)-coloring be extended to a proper \(k\)-coloring of the whole graph \(G\)?
Biró, M., Hujter, M., Tuza, Zs.
openaire +2 more sources
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source
Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser +14 more
wiley +1 more source
A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern
A graph is an interval graph if and only if each vertex in the graph can be associated with an interval on the real line such that any two vertices are adjacent in the graph exactly when the corresponding intervals have a nonempty intersection.
Hitoshi Yamasaki, Takayoshi Shoudai
semanticscholar +1 more source

