Results 31 to 40 of about 3,915 (163)

Hyperviscous Diabetic Bone Marrow Niche Impairs BMSCs Osteogenesis via TRPV2‐Mediated Cytoskeletal‐Nuclear Mechanotransduction

open access: yesAdvanced Science, EarlyView.
Diabetic bone marrow exhibits pathological ECM hyperviscosity that activates TRPV2‐mediated Ca2⁺ influx, leading to perinuclear F‐actin disassembly, nuclear deformation, and chromatin condensation. This cytoskeletal‐nuclear decoupling suppresses osteogenic differentiation of BMSCs.
Yao Wen   +8 more
wiley   +1 more source

Characterizations of strongly chordal graphs

open access: yesDiscrete Mathematics, 1983
AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. These include a forbidden induced subgraph characterization and two characterizations in terms of totally balanced matrices. Another characterization yields a polynomial recognition algorithm.Interest in these graphs arises in several ways.
openaire   +1 more source

Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs [PDF]

open access: yesCombinatorica, 2008
A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal--Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. In addition, it will be shown that a quasi-forest is shellable if and only if its $h$-vector $(h_0, h_1, h_2 ...
Herzog, Jürgen   +4 more
openaire   +3 more sources

Single‐Cell RNA Sequencing of Human Lung Tissues Reveals Metallothionein‐Positive T Cells as a Novel Potential Marker of Susceptibility to Chronic Obstructive Pulmonary Disease

open access: yesAdvanced Science, EarlyView.
Using single‐cell RNA sequencing of lung samples and flow cytometry of peripheral blood, we identified a novel T cell subset with high metallothionein (MT) expression. These MT‐high T cells suppress CD8+ T cell cytotoxicity and are progressively depleted from healthy controls to chronic obstructive pulmonary disease (COPD) patients, positioning them as
Zengqing Liu   +23 more
wiley   +1 more source

Data Reduction for Graph Coloring Problems

open access: yes, 2013
This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring
Bart M.P. Jansen   +30 more
core   +1 more source

Immune Predictors of Radiotherapy Outcomes in Cervical Cancer

open access: yesAdvanced Science, EarlyView.
This study reveals dynamic immune remodeling in cervical cancer following radiotherapy. Single‐cell analysis identifies the C3/C3AR1 axis as a central mediator of epithelial–myeloid crosstalk, whose inhibition reduces treatment efficacy in mice. Guided by these insights, the eight‐feature machine‐learning model: Cervical Cancer Radiotherapy Immune ...
Linghao Wang   +8 more
wiley   +1 more source

Unraveling the Morphological and Functional Maturation Mechanisms Underlying Human Neural Development Using iPSCs‐Derived Neuronal Model

open access: yesAdvanced Science, EarlyView.
Using human induced pluripotent stem cells (hiPSCs)‐derived neuronal model, Tian and colleagues reveal that voltage‐gated calcium channels Cav1.2 and Cav1.3, and their mediated calcium ion influx, are essential for early morphogenesis of human neuronal development, while ECEL1 underlies human neuronal functional developmental maturation through CALM3 ...
Yue Tian   +5 more
wiley   +1 more source

Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs [PDF]

open access: yes, 2014
Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions.
Kimura, Kyouko
core  

Largest reduced neighborhood clique cover number revisited

open access: yes, 2017
Let $G$ be a graph and $t\ge 0$. The largest reduced neighborhood clique cover number of $G$, denoted by ${\hat\beta}_t(G)$, is the largest, overall $t$-shallow minors $H$ of $G$, of the smallest number of cliques that can cover any closed neighborhood ...
Brown, André EX   +11 more
core   +3 more sources

Strongly Chordal Graph Generation using Intersection Graph Characterisation

open access: yes, 2019
Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar characterisation for chordal graphs. Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm
Rahman, Md. Zamilur, Mukhopadhyay, Asish
openaire   +2 more sources

Home - About - Disclaimer - Privacy