Results 71 to 80 of about 251,114 (266)
On the distance eigenvalues of Cayley graphs
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Translating whole‐genome doubling into precision medicine in cancer
Whole‐genome doubling creates a WGD‐positive tumor state characterized by persistent chromosomal instability, karyotypic diversification, and cellular stress. These same biological pressures drive aggressive tumor evolution while exposing therapeutic vulnerabilities, providing a rationale for WGD‐informed precision medicine. Whole‐genome doubling (WGD)
Sejung Lee, Junghyeok Lim, Jinhyuk Bhin
wiley +1 more source
Distance antimagic labeling of join and corona of two graphs
Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
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
AbstractThe boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (Ø if x = y). It is determined in terms of the block-cutpoint graph of G, and shown to satisfy the triangle inequality b(x,y)⊆ b(x, z)∪b(z,y). We denote by B(G) the collection of distinct boolean distances
Frank Harary +3 more
openaire +3 more sources
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let ∂1≥⋯≥∂n $\partial_{1}\geq\cdots\geq\partial_{n}$, ∂1L≥⋯≥∂nL $\partial_{1}^{L}\geq\cdots\geq\partial_{n}^{L}$
Huicai Jia, Hongye Song
doaj +1 more source
Connectivity of distance graphs
Let \(K\supseteq\mathbb{Q}\) be a \(\mathbb{Z}\)-module and \(G\) a graph with a \(K\)- space as vertex set \(V\). If the edges of \(G\) are preserved under translations in \(V\) and \(G\) has more than one connected component, then the author shows that \(G\) has infinitely many components.
openaire +2 more sources
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

