Results 121 to 130 of about 125,344 (284)

Cell Cycle Control of Nuclear Metabolism Couples Phosphatidylinositol Signaling to Histone Methylation

open access: yesAdvanced Science, EarlyView.
Nuclear metabolism oscillates during cell cycle progression. Quantitative chromatome proteomics and imaging reveal phase‐specific dynamics of PIP5K1A and nuclear PIP2, linking phosphatidylinositol metabolism to histone methylation. This work identifies nuclear lipid metabolism as a previously unrecognized regulatory axis coordinating chromatin ...
Antoni Gañez‐Zapater   +13 more
wiley   +1 more source

Single‐Cell Transcriptomics Reveals FLS2‐Dependent Hypoxia Signaling and ERF13‐Mediated Transcription During flg22‐Triggered Immunity

open access: yesAdvanced Science, EarlyView.
This study employs sc‐RNA sequencing, genetics, and phenotyping to systematically map the cell‐type‐specific immune responses triggered by flg22. It reveals FLS2‐dependent transcriptional reprogramming in epidermal and mesophyll cells, and uncovers crosstalk between immune and hypoxia signaling pathways.
Yaping Zhou   +17 more
wiley   +1 more source

On vertex stability of complete k-partite graphs

open access: yesOpuscula Mathematica, 2015
Summary: Let \(H\) be any graph. We say that graph \(G\) is \(H\)-stable if \(G-u\) contains a subgraph isomorphic to \(H\) for an arbitrary chosen \(u \in V(G)\). We characterize all \(H\)-stable graphs of minimal size where \(H\) is any complete \(k\)-partite graph. Thus, we generalize the results of \textit{A. Dudek} and \textit{A.
openaire   +3 more sources

Structural Eigenmodes of the Brain to Improve the Source Localization of EEG: Application to Epileptiform Activity

open access: yesAdvanced Science, EarlyView.
Geometry and connectivity are complementary structures, which have demonstrated their ability to represent the brain's functional activity. This study evaluates geometric and connectome eigenmodes as biologically informed constraints for EEG source localization.
Pok Him Siu   +6 more
wiley   +1 more source

Tolerant Radon partitions on the all-paths convexity in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
In a graph G, the all-paths transit function A(u, v), consists of the set of all vertices in the graph G which lies in some path connecting u and v. Convexity obtained by the all-paths transit function is called all-paths convexity.
Sreekumar Sreedharan, Manoj Changat
doaj   +1 more source

PET Imaging of Cardiac Inflammation in Viral Myocarditis Using a DPP4‐Targeted Probe

open access: yesAdvanced Science, EarlyView.
This study describes a DPP4‐targeted PET probe for imaging myocardial inflammation by selectively targeting activated immune cells. Derived from the clinically approved small‐molecule inhibitor linagliptin, the probe demonstrates favorable biodistribution with specific cardiac uptake in myocarditis.
Wanhao Gao   +14 more
wiley   +1 more source

A Bottom‐Up Design Framework for Multifunctional Lattice Metamaterials

open access: yesAdvanced Science, EarlyView.
This study introduces a generative AI framework for designing multifunctional lattice metamaterials. The method combines 3D Gaussian voxel generation with deep learning, enabling greater design freedom and structural performance. The optimized lattice metamaterials achieve enhanced energy absorption by 40–200% compared to conventional structures and ...
Zongxin Hu   +13 more
wiley   +1 more source

Weighted Partition Vertex and Edge Cover

open access: yes
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph with weights on both vertices and edges, and a partition of the edge set into $ω$ groups, the goal is to select a ...
Dabas, Rajni   +2 more
openaire   +2 more sources

Limited packings: Related vertex partitions and duality issues

open access: yesApplied Mathematics and Computation
A $k$-limited packing partition ($k$LP partition) of a graph $G$ is a partition of $V(G)$ into $k$-limited packing sets. We consider the $k$LP partitions with minimum cardinality (with emphasis on $k=2$). The minimum cardinality is called $k$LP partition number of $G$ and denoted by $χ_{\times k}(G)$.
Ahmadi, Azam Sadat   +2 more
openaire   +3 more sources

Ecological Adaptation Mechanisms Underlying Successful Plant Reproduction

open access: yesAdvanced Science, EarlyView.
During floral induction, various environmental and endogenous signals converge to regulate the florigen protein, which is transported from leaves to the SAM to initiate flowering. Within the SAM, a complex network of receptor kinases and small peptides orchestrates floral development with high spatiotemporal precision.
Hang Zhao   +8 more
wiley   +1 more source

Home - About - Disclaimer - Privacy