Results 71 to 80 of about 3,872,892 (256)
Semistrong Edge Coloring and (0, 1)‐Relaxed Strong Edge Coloring of Graphs
ABSTRACT In this work, we study two relaxations of the well‐known strong edge coloring. A semistrong edge coloring of a graph is an edge coloring in which every color class forms a matching such that every edge of is incident with (at least) one vertex of degree 1 in the ...
Lin, Yuquan, Lin, Wensong
openaire +2 more sources
On the approximability of the maximum induced matching problem [PDF]
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele +12 more
core +1 more source
Drug resistance limits treatment success in a subset of lung cancers driven by ROS1 gene alterations. Using patient‐derived cells and computer simulations, we studied three key mutations and how they affect five targeted drugs. The mutations reduced drug effectiveness in different ways by altering protein structure and behavior.
Farhan Ul Haq +8 more
wiley +1 more source
CEACAM1 participation in breast cancer progression
In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
Strong Ramsey Numbers of All Sets of Three Graphs of Size 3
The strong Ramsey number R¯(F,H) of two graphs F and H without isolated vertices is the minimum positive integer n such that every red-blue (edge) coloring of Kn results in two edge-disjoint monochromatic subgraphs, one isomorphic to F and the other ...
Gary Chartrand, Ping Zhang
doaj +1 more source
This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source
Rainbow connection number of corona product of graphs
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj +1 more source
Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez +5 more
wiley +1 more source
The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim +17 more
wiley +1 more source

