Results 91 to 100 of about 641,529 (298)
Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang +12 more
wiley +1 more source
Distributed Edge Coloring and Locally Sparse Graph Coloring [PDF]
Graph coloring is a central problem in distributed computing. In this work, we study both the edge coloring and vertex coloring problems. For constant ɛ> 0, we give a distributed algorithm for (1 + ɛ)∆-edge coloring running in O(log ∗ log n ∆ · max(1,
Hsin-hao Su, Seth Pettie, Michael Elkin
core
Acyclic list edge coloring of outerplanar graphs [PDF]
An acyclic list edge coloring of a graph G is a proper list edge coloring such that no bichromatic cycles are produced. In this paper, we prove that an outerplanar graph G with maximum degree Δ≥5 has the acyclic list edge chromatic number equal to ...
Wang, Weifan, Shu, Qiaojun, Wang, Yiqiao
core +1 more source
Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic +5 more
wiley +1 more source
EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
Injective edge coloring of graphs [PDF]
Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of lengths three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if $e_{1}, e_{2}$ and
Cardoso, Domingos M. +3 more
core +1 more source
Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
Edge-DP-Coloring of Graphs [PDF]
A proper coloring of a graph $G$ is an assignment of colors to all vertices in $G$ so that adjacent vertices receive different colors. In this thesis, we will introduce a generalization of a coloring problem known as DP-coloring.
Minjung Kang
core +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Regular Colorings in Regular Graphs
An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r − 1 edges of one color and 1 edge of a different color.
Bernshteyn Anton +6 more
doaj +1 more source

