Results 111 to 120 of about 168,763 (311)
Minor-Obstructions for Apex-Pseudoforests
, 2021 A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices.
Singh, Alexandros +4 more
core +1 more source
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor
, 2023 The crossing number of a graph is the minimum number of crossings in any drawing of in the plane. The rectilinear crossing number of is the minimum number of crossings in any straight-line drawing of .
La Rose, Camille
core +1 more source
Molecular Oncology, EarlyView.Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Square roots of minor closed graph classes
, 2014 Let G be a graph class. The square root of G contains all graphs whose squares belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G.
Thilikos, D.M., Nestoridis, N.V.
core +2 more sources
FEBS Open Bio, EarlyView.CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
Bounds of Eigenvalues of
Journal of Inequalities and Applications, 2009 The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let be the smallest eigenvalue of . In this paper, we have described the -minor free graphs and showed that (A) let be a simple graph with order . If has no -
Fang Kun-Fu
doaj
FEBS Open Bio, EarlyView.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
G(10,30): A Minor-Minimal Intrinsically Knotted Graph
, 2023 In this paper, we shall lay the groundwork for a proof of the minor-minimal intrinsic knotting of the graph G(10, 30). We show that this graph is in fact minor minimal with respect to the property of intrinsic knotting, i.e that no minor of G(10, 30) is ...
Herron, Johanthan R.
core
Quantum Optimization of Fully Connected Spin Glasses
Physical Review X, 2015 Many NP-hard problems can be seen as the task of finding a ground state of a disordered highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it is often necessary to represent those graphs in the annealer’s hardware ...
Davide Venturelli +5 more
doaj +1 more source