Results 131 to 140 of about 34,901 (303)
Producing MSCs on rigid culture substrates induces a scar‐making phenotype, jeapordizing therapeutic success. ‘Tissue‐soft’ surfaces prevent MSC fibrogenesis and preserve regenerative traits. An epigenetic network, driven by HOXA11 and SALL1, maintains ‘soft memory’ by keeping chromatin open in relaxed MSCs, promoting anti‐fibrotic programs.
Fereshteh Sadat Younesi +7 more
wiley +1 more source
Old and new generalizations of line graphs
Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K3 and K1,3.
Jay Bagga
doaj +1 more source
Dynkin graphs and triangle singularities [PDF]
7 pages, AMS ...
openaire +4 more sources
Triangle strings: Structures for augmentation of vertex-disjoint triangle sets [PDF]
Vertex-disjoint triangle sets (triangle sets for short) have been studied extensively. Many theoretical and computational results have been obtained.
Zhang, Zan-Bo, Zhang, Xiaoyan
core +1 more source
Enhancing Maturation of Human Neuromuscular Organoids via Electrical Stimulation
A framework for on‐demand and non‐invasive exposure of human neuromuscular organoids (NMOs) to electrical stimuli is established to promote their maturation. The robustness and effectiveness of different stimulation regimes are evaluated via thorough characterization of organoid tissue structure and contraction capacity. Chronic electrical stimulation,
Chrysanthi‐Maria Moysidou +12 more
wiley +1 more source
Whole‐genome analysis of 1,054 chickens reveals three ancestral sources (NWC, SYA, and SHF) with distinct temporal entry patterns into the Tibetan Plateau. Route‐specific selection scans, calibrated against a demographic null, suggest complementary functional enrichments—vascular homeostasis (NWC), calcium signaling and cardiac adaptation (SYA), and ...
Zongyi Zhao +7 more
wiley +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
$P_6$-free triangle-free graphs
I will talk about an explicit construction for triangle-free graphs that do not contain a six-vertex path as an induced subgraph. Examples include the 16-vertex Clebsch graph, and the graph that arises from a complete bipartite graph by subdividing every
Spirkl, Sophie
core
TaMYB7‐A1 directly activates TaABI5 to enhance ABA signaling and regulate ABA‐GA homeostasis, enforcing seed dormancy. Its superior allele, derived from wild einkorn introgression, harbors a MITE insertion that elevates expression and two amino acid substitutions that enhance transcriptional activity, collectively generating graded PHS resistance for ...
Hao Wang +18 more
wiley +1 more source
SDS‐CRISPR for Single‐Nucleotide Variant Detection
Structure‐disruption‐sensitive CRISPR (SDS‐CRISPR) converts structural instability into single‐nucleotide precision, thereby overcoming mismatch tolerance in canonical Cas12a and enabling versatile diagnostics across DNA, RNA, and microRNA targets. When applied to rapid IDH1 mutation detection for glioma genotyping and integrated with lateral‐flow ...
Xin Guan +12 more
wiley +1 more source

