Results 61 to 70 of about 832,958 (281)
Molecular Oncology, EarlyView.Clinical trials on PARP inhibitors in urothelial carcinoma (UC) showed limited efficacy and a lack of predictive biomarkers. We propose SLFN5, SLFN11, and OAS1 as UC‐specific response predictors. We suggest Talazoparib as the better PARP inhibitor for UC than Olaparib.
Jutta Schmitz +15 more
wiley +1 more source
Bounds for some distance-based and degree-distance-based topological indices [PDF]
Contributions to Mathematics, 2022 Gul Ozkan Kızılırmak
doaj +1 more source
Variation of sum of two largest eigenvalues of the distance matrices of four-leaf graph
Journal of Hebei University of Science and Technology, 2020 In order to accurately obtain the extremum of the distance eigenvalues of fowr-leaf graphs under tow graph transformations in any case, two graph transformations of four-leaf graphs and the results of the above problems were given by using the properties
Zhe LYU, Yubin GAO
doaj +1 more source
Molecular 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
Metrics for Single-Edged Graphs over a Fixed Set of Vertices
Mathematical and Computational Applications, 2018 Graphs have powerful representations of all kinds of theoretical or experimental mathematical objects. A technique to measure the distance between graphs has become an important issue.
Ray-Ming Chen
doaj +1 more source
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
On Domination Number and Distance in Graphs [PDF]
, 2014 A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating ...
Kang, Cong X.
core
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
, 2019 A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels.
Alstrup S. +5 more
core +3 more sources
Molecular 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
On the Wiener index of two families generated by joining a graph to a tree [PDF]
Discrete Mathematics Letters, 2022 Andrey A. Dobrynin
doaj +1 more source