Results 81 to 90 of about 18,582 (315)
Molecular Oncology, EarlyView.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
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael O. Albertson, Emily H. Moore
openaire +1 more source
Graph Coloring Algorithm Based on Minimal Cost Graph Neural Network
IEEE AccessThe graph coloring problem functions as a fundamental and pivotal combinatorial optimization task and has played an essential role in various domains such as wireless spectrum management, register planning, and event scheduling.
Ming Gao, Jing Hu
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.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
Discrete Mathematics, 2009 In this paper, some results concerning the colorings of graph powers are presented. The notion of helical graphs is introduced. We show that such graphs are hom-universal with respect to high odd-girth graphs whose $(2t+1)$st power is bounded by a Kneser graph. Also, we consider the problem of existence of homomorphism to odd cycles. We prove that such
openaire +3 more sources
Bilangan Kromatik Permainan Graf Ubur-Ubur, Graf Siput, dan Graf Gurita
Jambura Journal of MathematicsGraph coloring is the process of assigning colors to the vertices or edges of a graph. Specifically, coloring the vertices in graph coloring can be implemented in graph coloring games.
M Luthfi Abdurahman +2 more
doaj +1 more source
Total Coloring Conjecture for Certain Classes of Graphs
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +1 more source
The equivalence of two graph polynomials and a symmetric function
, 2009 The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any ...
Noble, SD +5 more
core +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Multi-colored spanning graphs [PDF]
Theoretical Computer Science, 2016 We study a problem proposed by Hurtado et al. (2016) motivated by sparse set visualization. Given $n$ points in the plane, each labeled with one or more primary colors, a \emph{colored spanning graph} (CSG) is a graph such that for each primary color, the vertices of that color induce a connected subgraph.
Akatya, Hugo +2 more
openaire +5 more sources