Results 61 to 70 of about 1,862,441 (301)
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
FEBS Letters, EarlyView.This study reveals that the small GTPase Rab14 is necessary for human papillomavirus (HPV) infection and plays an essential role in the transport of virions to the trans‐Golgi network (TGN). HPV in the early endosome (EE), which harbors GTP‐bound Rab14, is transported to the TGN through the switch of Rab14 from its GTP‐bound to GDP‐bound form.
Yoshiyuki Ishii, Iwao Kukimoto
wiley +1 more source
Exploration of graphs with excluded minors
Journal of Computer and System Sciencesto appear at ESA ...
Júlia Baligács +3 more
openaire +4 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP [PDF]
, 2015 We prove a general reduction theorem which allows us to extend bounds for certain graph parameters on cubic graphs to bounds for general graphs taking into account the individual vertex degrees.
Edwards, Keith, McDermid, Eric
core +1 more source
Bipartite graphs with no K6 minor
Journal of Combinatorial Theory, Series BA theorem of Mader shows that every graph with average degree at least eight has a $K_6$ minor, and this is false if we replace eight by any smaller constant. Replacing average degree by minimum degree seems to make little difference: we do not know whether all graphs with minimum degree at least seven have $K_6$ minors, but minimum degree six is ...
Chudnovsky, M +3 more
openaire +5 more sources
On the geometry of graphs with a forbidden minor [PDF]
Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009 We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture to a pair of manifestly simpler conjectures. The GNRS conjecture characterizes all graphs that have an O(1)-approximate multi-commodity max-flow/min-cut theorem. In particular,
James R. Lee, Anastasios Sidiropoulos
openaire +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
Nonvanishing minors of eigenvector matrices and consequences
Special MatricesFor a matrix M∈Kn×n{\bf{M}}\in {{\mathbb{K}}}^{n\times n}, we establish a condition on the Galois group of the characteristic polynomial φM{\varphi }_{{\bf{M}}} that induces nonvanishing of the minors of the eigenvector matrix of M{\bf{M}}.
Emmrich Tarek
doaj +1 more source