Results 91 to 100 of about 942,096 (280)

Hyperosmotic stress‐induced redistribution of pre‐mRNA cleavage factor I subunits is associated with shifts in alternative polyadenylation

open access: yesFEBS Open Bio, EarlyView.
Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya   +2 more
wiley   +1 more source

A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers

open access: yesEntropy, 2016
Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of complex networks. The starting point has been always based on assigning a probability distribution to a network when using Shannon’s ...
Kinkar Chandra Das, Matthias Dehmer
doaj   +1 more source

Generalized Degree-Based Graph Entropies [PDF]

open access: yesSymmetry, 2017
Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network.
openaire   +2 more sources

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

open access: yesFEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss   +7 more
wiley   +1 more source

On Marginal Entropy of Graphs

open access: yesCroatica Chemica Acta, 2021
Marginal entropy is one of the distances based on the graph entropy. Then, this entropy is computed by the Wiener index of graphs. In this paper, we obtain the marginal entropy of paths, stars, double stars, cycles and vertex-transitive graphs.
openaire   +3 more sources

Exploring the influence of lactoferrin on wound healing and related signaling pathways: a systematic review

open access: yesFEBS Open Bio, EarlyView.
Lactoferrin promotes wound healing by activating MAPK, PI3K/Akt, and extracellular matrix pathways, enhancing fibroblast remodeling, proliferation, and re‐epithelialization. These mechanisms highlight its therapeutic potential in inflammation control, tissue repair, and remodeling.
Morgana Lüdtke Azevedo   +4 more
wiley   +1 more source

Entropy-Guided Graph Clustering via Rényi Optimization

open access: yes
Graph clustering is a fundamental task in network analysis, with applications ranging from community detection to protein complex identification. While Graph Neural Networks (GNNs) have shown promising results in this domain, they often struggle to ...
Begga, Ahmed   +5 more
core   +1 more source

Perfection, Imperfection, and Graph Entropy

open access: yesElectronic Notes in Discrete Mathematics, 2000
Abstract Several connections between perfect graphs and the information theoretic functional graph entropy has been found in the last ten-fifteen years. A new development is that a newly introduced measure of graph imperfection, the imperfection ratio can also be characterized in terms of graph entropy.
openaire   +2 more sources

Evaluating the effect of γ‐oryzanol on MASLD pathology using a medaka fish model

open access: yesFEBS Open Bio, EarlyView.
This study explores a liver disease called MASLD, which is increasing worldwide and can lead to serious damage. Researchers used medaka fish instead of rodents to test a food compound, γ‐oryzanol. Fish fed this compound had less liver fat and healthier gut bacteria.
Yukako Ito   +7 more
wiley   +1 more source

Permutation Entropy for Time Series Over n-Distance Path Graphs

open access: yesIEEE Access
Permutation entropy (PE) is a widely used metric for quantifying the complexity of time series data. Recent efforts have extended PE to graph signals, resulting in the graph permutation entropy (GPE), which accounts for the interdependencies encoded in ...
Isabela B. V. Nogueira, Juliano B. Lima
doaj   +1 more source

Home - About - Disclaimer - Privacy