Results 131 to 140 of about 8,016,307 (335)
Resolving Sets without Isolated Vertices
AbstractLet G be a connected graph. Let W = (w1, w2, ..., wk ) be a subset of V with an order imposed on it. For any v ∈ V, the vector r(v|W) = (d(v, w1), d(v, w2), ..., d(v, wk )) is called the metric representation of v with respect to W. If distinct vertices in V have distinct metric representations, then W is called a resolving set of G.
Chitra, P. Jeya Bala, Arumugam, S.
openaire +1 more source
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Metric dimension of dual polar graphs
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F., Spiga, Pablo
core
The role of histone modifications in transcription regulation upon DNA damage
This review discusses the critical role of histone modifications in regulating gene expression during the DNA damage response (DDR). By modulating chromatin structure and recruiting repair factors, these post‐translational modifications fine‐tune transcriptional programmes to maintain genomic stability.
Angelina Job Kolady, Siyao Wang
wiley +1 more source
β‐TrCP overexpression enhances cisplatin sensitivity by depleting BRCA1
Low levels of β‐TrCP (Panel A) allow the accumulation of BRCA1 and CtIP, which facilitate the repair of cisplatin‐induced DNA damage via homologous recombination (HR) and promote tumor cell survival. In contrast, high β‐TrCP expression (Panel B) leads to BRCA1 and CtIP degradation, impairing HR repair, resulting in persistent DNA damage and apoptosis ...
Rocío Jiménez‐Guerrero +8 more
wiley +1 more source
Graphs with distinguishing sets of size k
The size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar +3 more
doaj +1 more source
Further new results on strong resolving partitions for graphs
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source
AZD9291 has shown promise in targeted cancer therapy but is limited by resistance. In this study, we employed metabolic labeling and LC–MS/MS to profile time‐resolved nascent protein perturbations, allowing dynamic tracking of drug‐responsive proteins. We demonstrated that increased NNMT expression is associated with drug resistance, highlighting NNMT ...
Zhanwu Hou +5 more
wiley +1 more source
Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph
Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges
Jia-bao Liu +3 more
semanticscholar +1 more source
This study indicates that Merkel cell carcinoma (MCC) does not originate from Merkel cells, and identifies gene, protein & cellular expression of immune‐linked and neuroendocrine markers in primary and metastatic Merkel cell carcinoma (MCC) tumor samples, linked to Merkel cell polyomavirus (MCPyV) status, with enrichment of B‐cell and other immune cell
Richie Jeremian +10 more
wiley +1 more source

