Results 131 to 140 of about 10,361 (216)

Multi‐Omics Data Reveal Estrogen‐Driven Dysregulation and Stromal‐Epithelial Signaling Alterations in Endometrial Polyps

The FASEB Journal, Volume 40, Issue 5, 15 March 2026.
Single‐cell transcriptomic profiling reveals that endometrial polyps arise from estrogen‐driven disruption of stromal‐epithelial signaling. Stromal cells exhibit enhanced WNT, IGF, and VEGF pathways, promoting epithelial proliferation and vascular remodeling.
Tingwei Chen, Bo Zhang, Zhengli Zhou, Naixue Yang, Ting Liu, Huimei Zhang, Yu Yin, Xiaomei Wu, Xiaozhuo Li, Tao Yu, Xiaodie Wang, Tianqing Li, E. Dong   +12 more
wiley   +1 more source

Exploring Dominating Functions and Their Complexity in Subclasses of Weighted Chordal Graphs and Bipartite Graphs

Mathematics
Domination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity.
Chuan-Min Lee
doaj   +1 more source

Modeling Multivariate Spatial Dependencies Using Graphical Models. [PDF]

N Engl J Stat Data Sci, 2023
Dey D, Datta A, Banerjee S.
europepmc   +1 more source

Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs. [PDF]

J Comb Optim, 2010
Liu C, Song Y.
europepmc   +1 more source

Hop domination in chordal bipartite graphs

Discussiones Mathematicae Graph Theory, 2023
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan   +2 more
doaj   +1 more source

Graph classes related to chordal graphs and chordal bipartite graphs

Electronic Notes in Discrete Mathematics, 2006
Ngoc Tuy Nguyen, Jörg Bornemann, Van Bang Le   +2 more
openaire   +1 more source

Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]

Algorithms Mol Biol, 2023
Marchand B, Will S, Berkemer SJ, Ponty Y, Bulteau L.   +4 more
europepmc   +1 more source

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc   +1 more source

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k.
openaire  

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source