Results 51 to 60 of about 1,232,284 (259)
On the independence ratio of distance graphs [PDF]
, 2014 A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph $G$ is the maximum density of an independent set in $G$. Lih, Liu, and
Carraher, James M. +4 more
core +1 more source
Molecular Oncology, EarlyView.CDK11 inhibition stabilises the tumour suppressor p53 and triggers the production of an alternative p21WAF1 splice variant p21L, through the inactivation of the spliceosomal protein SF3B1. Unlike the canonical p21WAF1 protein, p21L is localised in the cytoplasm and has reduced cell cycle‐blocking activity.
Radovan Krejcir +12 more
wiley +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
Discrete Dynamics in Nature and Society, 2021 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n
Gaixiang Cai, Xing-Xing Li, Guidong Yu
doaj +1 more source
Distance-regular Subgraphs in a Distance-regular Graph, IV
European Journal of Combinatorics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Molecular Oncology, EarlyView.Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source
No finite $5$-regular matchstick graph exists [PDF]
, 2014 A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart.
Kurz, Sascha
core
Monophonic-triangular Distance in Graphs
Proyecciones (Antofagasta)A path u1, u2, ..., un in a connected graph G such that for i, j with j ≥ i + 3, there does not exist an edge uiuj , is called a monophonic-triangular path or mt-path. The monophonic-triangular distance or mt-distance dmt(u, v) from u to v is defined as the length of a longest u−v mt-path in G.
Titus, P. +2 more
openaire +2 more sources
Intein‐based modular chimeric antigen receptor platform for specific CD19/CD20 co‐targeting
Molecular Oncology, EarlyView.CARtein is a modular CAR platform that uses split inteins to splice antigen‐recognition modules onto a universal signaling backbone, enabling precise, scarless assembly without re‐engineering signaling domains. Deployed here against CD19 and CD20 in B‐cell malignancies, the design supports flexible multi‐antigen targeting to boost T‐cell activation and
Pablo Gonzalez‐Garcia +9 more
wiley +1 more source
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
Fractional Local Metric Dimension of Comb Product Graphs
مجلة بغداد للعلوم, 2020 The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by .
Siti Aisyah +2 more
doaj +1 more source