Results 101 to 110 of about 544,762 (274)
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
Product version of reciprocal degree distance of composite graphs
In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
K. Pattabiraman
doaj +1 more source
The geodetic number of strong product graphs
For two vertices u and v of a connected graph G, the set IG[u; v] consists of all those vertices lying on u v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u; v] for u; v 2 S is denoted by IG[S]. A set S V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G ...
A.P. Santhakumaran, S.V. Ullas Chandran
openaire +1 more source
We developed a cost‐effective methylation‐specific droplet digital PCR multiplex assay containing tissue‐conserved and tumor‐specific methylation markers. The assay can detect circulating tumor DNA with high accuracy in patients with localized and metastatic colorectal cancer.
Luisa Matos do Canto +8 more
wiley +1 more source
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj +1 more source
Product Operations on Pythagorean Co-Neutrosophic Graphs and its Application [PDF]
Pythagorean Co-Neutrosophic Graphs (PyCNGs) have newly emerged after the foundation of Pythagorean fuzzy graph and Co-neutrosophic graphs, where the membership of indeterminacy(uncertain) is independent and membership of truth(existence) & false(non ...
G. Vetrivel, M. Mullai , G. Rajchakit
doaj +1 more source
The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola +12 more
wiley +1 more source
The cancer problem is increasing globally with projections up to the year 2050 showing unfavourable outcomes in terms of incidence and cancer‐related deaths. The main challenges are prevention, improved therapeutics resulting in increased cure rates and enhanced health‐related quality of life.
Ulrik Ringborg +43 more
wiley +1 more source
1-factorisation of the Composition of Regular Graphs
1-factorability of the composition of graphs is studied. The followings sufficient conditions are proved: $G[H]$ is 1-factorable if $G$ and $H$ are regular and at least one of the following holds: (i) Graphs $G$ and $H$ both contain a 1-factor, (ii) $G ...
Mohar, B. +2 more
core

