Results 41 to 50 of about 8,782,249 (234)
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences [PDF]
We provide a linear time algorithm for determining the sets of vertices that belong to all, some and no minimum dominating sets of a tree, respectively, thus improving the quadratic time algorithm of Benecke and Mynhardt in 2008 [S.
Radosław Ziemann, Paweł Żyliński
doaj +1 more source
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen +5 more
wiley +1 more source
Domination parameters of a graph with added vertex [PDF]
Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with \(xy\in E\).
Maciej Zwierzchowski
doaj
SPG4 and Dementia: Expanding the Clinical Spectrum
ABSTRACT Objective Hereditary spastic paraplegia (HSP) is a group of disorders characterized by progressive spasticity and lower limb weakness, with mutations in SPG4/SPAST being the most common cause. Detailed studies and clinical and molecular comparisons across different populations are missing.
Emanuele Panza +19 more
wiley +1 more source
Secure domination number of $k$-subdivision of graphs [PDF]
Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$.
Ghanbari, Nima
core +1 more source
Review of Methods and Algorithms for Modelling Transportation Networks Based on Graph Theory
One of the best ways of modelling a transport network is to use a graph with vertices and edges. They represent nodes and arcs of such network respectively.
S. Guze
doaj +1 more source
ABSTRACT Objectives Focal cortical dysplasia (FCD) is the most common etiology of drug‐resistant epilepsy in children. Focal to bilateral tonic–clonic seizures (FBTCS) mark a high risk of drug‐resistant epilepsy and involve thalamocortical circuitry in their generation and propagation.
Hua Xie +8 more
wiley +1 more source

