Results 51 to 60 of about 9,482,745 (250)

Soft motions encoded by the fold and mediated by conserved hinge sites drive V‐ATPase allosteric machinery and autoinhibition

open access: yesFEBS Letters, EarlyView.
Vacuolar H+‐ATPase (V‐ATPase) is a multisubunit rotary proton pump that acidifies intracellular compartments. Using elastic network models, we identified conserved hinge residues that govern its large‐scale functional motions. We show that intrinsically encoded ‘soft modes’ drive critical functional transitions, including rotary catalysis and ...
Diksha Parwana   +3 more
wiley   +1 more source

How structural disorder and polyelectrolyte properties of prothymosin α enable its large interactome

open access: yesFEBS Letters, EarlyView.
In this review, complexes of the fully disordered and highly negatively charged prothymosin α are collected, described, and discussed. Linked to its poly‐electrostatic character, prothymosin α engages a large interactome through multiple different binding modes ranging from fully disordered complexes to short linear motif (SLiM)‐driven interactions ...
Ketty C. Tamburrini   +3 more
wiley   +1 more source

Paired Eternal Domination in Grid Graphs and k-Trees [PDF]

open access: yes, 2023
We explore the paired eternal domination number on two different classes of graphs. The paired eternal domination problem is a variation on eternal domination where guards must remain paired after every move.
Penner, Georgia
core  

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

open access: yesMolecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

Singed Total Domatic Number of a Graph [PDF]

open access: yes, 2010
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol   +2 more
core   +1 more source

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
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

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

open access: yesMolecular Oncology, EarlyView.
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

When the connected domination number is at most the total domination number [PDF]

open access: yes, 2011
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core   +2 more sources

Paired-Domination in Graphs

open access: yes, 1998
In a graph G = (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then domination requires every vertex to be protected.
Haynes, Teresa W.   +3 more
core   +1 more source

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

open access: yes, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy