Results 51 to 60 of about 999 (266)
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
FEBS 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
Bounding Extremal Degrees of Edge-Independent Random Graphs Using Relative Entropy
Entropy, 2016 Edge-independent random graphs are a model of random graphs in which each potential edge appears independently with an individual probability. Based on the relative entropy method, we determine the upper and lower bounds for the extremal vertex degrees ...
Yilun Shang
doaj +1 more source
Heterotropic regulation and negative homotropic cooperativity
FEBS Open Bio, EarlyView.We identified a structural module common to some proteins that couple negative cooperativity with heterotropic regulation, two features that rarely coexist. These proteins are ring‐like and present an ordered asymmetry whereby noncontacting subunits are symmetric, and their tertiary structure differs from that of contacting subunits.
Veronica Morea +5 more
wiley +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone +8 more
wiley +1 more source
Spectral extremal graphs for fan graphs
Discrete Mathematics21 pages,2 ...
Loujun Yu, Yongtao Li, Yuejian Peng
openaire +3 more sources
Unicyclic Graphs with the Fourth Extremal Wiener Indices
Journal of Chemistry, 2020 A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang +3 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
Solution to the minimum harmonic index of graphs with given minimum degree [PDF]
Transactions on Combinatorics, 2018 The harmonic index of a graph $G$ is defined as $ H(G)=\sum\limits_{uv\in E(G)}\frac{2}{d(u)+d(v)}$, where $d(u)$ denotes the degree of a vertex $u$ in $G$. Let $\mathcal{G}(n,k)$ be the set of simple $n$-vertex graphs with minimum degree at least $k$
Meili Liang, Bo Cheng, Jianxi Liu
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Down syndrome regression disorder is a syndrome characterized by subacute loss of cognitive, behavioral, and functional abilities in individuals with Down syndrome. Electroencephalography abnormalities are frequently observed during evaluation, but it remains unclear whether these findings represent a dynamic marker of disease ...
Jonathan D. Santoro +14 more
wiley +1 more source
Extremals of functions on graphs with applications to graphs and hypergraphs
Journal of Combinatorial Theory, Series B, 1982 AbstractThe method used in an article by T. S. Matzkin and E. G. Straus [Canad. J. Math. 17 (1965), 533–540] is generalized by attaching nonnegative weights to t-tuples of vertices in a hypergraph subject to a suitable normalization condition. The edges of the hypergraph are given weights which are functions of the weights of its t-tuples and the graph
T. Sós, Vera, Straus, E. G.
openaire +3 more sources