Results 61 to 70 of about 28,279 (264)
Distance regularity of compositions of graphs
The strong sum of graphs \(G_1\) and \(G_2\), \( G_1 \oplus G_2 \), is the graph whose vertex set is the Cartesian product \(V(G_1) \times V(G_2)\), and \((u_1,v_1)\) is adjacent to \((u_2,v_2)\) if \(u_1\) is adjacent to \(u_2\) and \(v_1\) is adjacent to \(v_2\) or if \(u_1\) is adjacent to \(u_2\) and \(v_1 = v_2\).
openaire +2 more sources
LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
The distance spectrum of corona and cluster of two graphs
Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj +1 more source
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
CEACAM1 participation in breast cancer progression
In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Graphs, friends and acquaintances
A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people.
Cristina Dalfo, Miquel Àngel Fiol
doaj +1 more source
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Parallelogram-Free Distance-Regular Graphs
This paper deals with distance-regular graphs. It is shown that a distance-regular graph with certain properties has classical parameters \((d,b,\alpha,\beta)\) with ...
Yuh-jeng Liang, Chih-Wen Weng
openaire +2 more sources
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source

