Results 41 to 50 of about 444 (188)
CHCHD10 loss in Alzheimer's disease is associated with mitochondrial dysfunction, epigenomic disruption, and tau pathology. Restoration of CHCHD10 shifts DNA methylation toward a non‐disease state and reduces tau and amyloid pathology, with KATNAL2 acting as a downstream effector.
Teresa M. Thomas +13 more
wiley +1 more source
Strongly chordal and chordal bipartite graphs are sandwich monotone [PDF]
A graph class is sandwich monotone if, for every pair of its graphs G (1)=(V,E (1)) and G (2)=(V,E (2)) with E (1)aS,E (2), there is an ordering e (1),aEuro broken vertical bar,e (k) of the edges in E (2)a-E (1) such that G=(V,E (1)a(a){e (1),aEuro ...
Heggernes, P. +3 more
core
Hamiltonian circuits in chordal bipartite graphs [PDF]
The main result of this paper is the NP-completeness of the HAMILTONIAN CIRCUIT problem for chordal bipartite graphs. This is proved by a sophisticated reduction from SATISFIABILITY. As a corollary, HAMILTONIAN CIRCUIT is NP-complete for strongly chordal
Müller, Haiko
core +1 more source
Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems [PDF]
In this work, we consider the graph sandwich decision problem for property Π, introduced by Golumbic, Kaplan and Shamir: given two graphs G1=(V,E1) and G2=(V,E2), the question is to know whether there exists a graph G=(V,E) such that E1⊆E⊆E2 and G satisfies property Π. Particurlarly, we are interested in fully classifying the complexity of this problem
Fernanda Couto +2 more
openaire +1 more source
THBS1+ Macrophages Exacerbate Modic Changes via SDC4‐Dependent Activation of NLRP3 Inflammasome
The illustration of THBS1+ macrophages exacerbate MCs via SDC4‐dependent activation of the NLRP3 inflammasome. THBS1+ macrophage subpopulation was identified in MCs through single‐cell RNA sequencing. C. acnes and its metabolites activate THBS1 expression in macrophages via the TLR signaling pathway.
Xiangxi Kong +16 more
wiley +1 more source
Tree spanners on chordal graphs: complexity and algorithms [PDF]
A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t.
Le, Hoàng-Oanh +3 more
core +1 more source
Counting independent sets in strongly orderable graphs [PDF]
We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem when G is restricted to the class of strongly orderable graphs, a superclass ...
Müller, H, Heinrich, M
core +1 more source
Molecular and Cellular Hallmarks of Age‐Related Vestibular Hair Cell Degeneration
This study utilizes single‐cell RNA‐seq transcriptomes, advanced imaging, and electrophysiology to examine universal and cell‐type‐specific aging signatures of vestibular hair cells. The study shows that impaired hair bundle function is a key driver of age‐related vestibular dysfunction.
Samadhi Kulasooriya +10 more
wiley +1 more source
A mitochondria‐targeted, microenvironment‐responsive nanoplatform enables pH/ROS‐triggered co‐delivery of berberine and isoliensinine to orchestrate ROS scavenging, inflammation suppression, and apoptosis inhibition. This vertical modulation of mitochondrial pathological networks preserves mitochondrial function and effectively mitigates myocardial ...
Jue Wang +11 more
wiley +1 more source
On the pathwidth of chordal graphs [PDF]
In this paper we first show that the pathwidth problem for chordal graphs is NP-hard.Then we give polynomial algorithms for subclasses. One of those classes are the k-starlike graphs – a generalization of split graphs.
Gusted, Jens
core +1 more source

