Results 41 to 50 of about 3,872,853 (232)

A novel quinazolinone insulin receptor inhibitor and its synergy with an EGFR inhibitor in glucose‐driven glioblastoma

open access: yesMolecular Oncology, EarlyView.
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka   +9 more
wiley   +1 more source

An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem [PDF]

open access: yes, 2004
A nearly equitable edge-coloring of a multigraph is a coloring such that edges incident to each vertex are colored equitably in number. This problem was solved in O(kn^2) time, where n and k are the numbers of the edges and the colors, respectively.
XIE, Xuzhen   +3 more
core  

Strong edge coloring for channel assignment in wireless radio networks

open access: yes, 2006
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links ...
Barrett, C.L.   +11 more
core   +1 more source

Loss of proton‐sensing TDAG8 increases tumor progression in mouse models of colon cancer

open access: yesMolecular Oncology, EarlyView.
Loss of the pH‐sensing receptor TDAG8 accelerates colorectal cancer progression in mice. Animals lacking TDAG8 expression had increased tumor growth, DNA damage, and recruitment of tumor‐associated immune cells, including macrophages, neutrophils, and monocytes.
Ermanno Malagola   +11 more
wiley   +1 more source

Strong edge-colorings for $$k$$ k -degenerate graphs

open access: yesGraphs and Combinatorics, 2014
We prove that the strong chromatic index for each $k$-degenerate graph with maximum degree $Δ$ is at most $(4k-2)Δ-k(2k-1)+1$.
openaire   +3 more sources

An Introduction to Fuzzy Edge Coloring [PDF]

open access: yes, 2016
In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color.
K.S, Kanzul Fathima, Hussain R, Jahir
core   +1 more source

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

open access: yesMolecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur   +11 more
wiley   +1 more source

In vitro and in silico modelling of ROS1‐positive non‐small cell lung cancer reveals fusion‐dependent tyrosine kinase inhibitor responses

open access: yesMolecular Oncology, EarlyView.
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

On the approximability of the maximum induced matching problem [PDF]

open access: yes, 2005
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

Strong Edge Coloring of K4(t)-Minor Free Graphs

open access: yes, 2023
A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring ...
Murong Xu, Miaomiao Han, Huixin Yin
core   +1 more source

Home - About - Disclaimer - Privacy