Results 121 to 130 of about 4,550,446 (348)

Homomorphic Preimages of Geometric Cycles

open access: yes, 2015
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core  

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra   +10 more
wiley   +1 more source

Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells

open access: yesMolecular Oncology, EarlyView.
Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son   +13 more
wiley   +1 more source

On the beta-number of linear forests with an even number of components

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is , otherwise.
Rikio Ichishima, Akito Oshima
doaj   +1 more source

Relations between the distinguishing number and some other graph parameters [PDF]

open access: yesریاضی و جامعه
A distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi   +1 more
doaj   +1 more source

Knowledge graph and knowledge reasoning: A systematic review

open access: diamond, 2022
Ling Tian   +5 more
openalex   +1 more source

Creating effective interrupted time series graphs: Review and recommendations [PDF]

open access: hybrid, 2020
Simon Turner   +8 more
openalex   +1 more source

Molecular characterisation of human penile carcinoma and generation of paired epithelial primary cell lines

open access: yesMolecular Oncology, EarlyView.
Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad   +12 more
wiley   +1 more source

Distance antimagic labeling of circulant graphs

open access: yesAIMS Mathematics
A distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes ...
Syafrizal Sy   +4 more
doaj   +1 more source

Methylation biomarkers can distinguish pleural mesothelioma from healthy pleura and other pleural pathologies

open access: yesMolecular Oncology, EarlyView.
We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck   +12 more
wiley   +1 more source

Home - About - Disclaimer - Privacy