Results 121 to 130 of about 15,625 (297)
A note on certain ergodicity coeflcients
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized ...
Tudisco Francesco
doaj +1 more source
Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill +6 more
wiley +1 more source
Powers of the vertex cover ideals [PDF]
We describe a combinatorial condition on a graph which guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated by Eagon and Reiner's Theorem we study whether all powers of the vertex cover ideal of a Cohen-Macaulay ...
Mohammadi, Fatemeh, Fatemeh Mohammadi
core +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
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
Uniqueness of graph square roots of girth six [PDF]
We prove that if two graphs of girth atleast 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least
Micha L Adamaszek +3 more
core
Rooted directed path graphs are leaf powers [PDF]
Leaf powers are a graph class which has been introduced to model the problem of reconstructing phylogenetic trees. A graph G=(V,E) is called k-leaf power if it admits a k-leaf root, i.e., a tree T with leaves V such that uv is an edge in G if and only if
Hundt, Christian +3 more
core +1 more source
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
On powers of m-trapezoid graphs
The author introduces \(m\)-trapezoid graphs (\(m\)-TGs) as intersection graphs of \(m\)-trapezoids, where an \(m\)-trapezoid is given by \(m+ 1\) intervals on \(m+ 1\) parallel lines. (The class of 0-TGs is the class of interval graphs.) The main result concerns powers of graphs: If \(G^{k- 1}\) is an \(m\)-TG then \(G^k\) is also an \(m\)-TG.
openaire +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
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
Bounds on graph eigenvalues [PDF]
Upper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a function of the number of vertices or ...
Powers, David L.
core +1 more source

