Results 121 to 130 of about 3,100,536 (300)
FEBS Open Bio, EarlyView.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
On the extreme complexity of certain nearly regular graphs
Theory and Applications of GraphsThe complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs are graphs of maximal complexity among all graphs of the same order and degree; their complements are ...
Gregory P Constantine, Gregory C Magda
doaj +1 more source
A (49,16,3,6) strongly regular graph does not exist [PDF]
, 1988 Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = (49, 16, 3, 6). In this paper we show that such a graph cannot exist.
Bussemaker, F.C. +5 more
core
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
q-analogs of strongly regular graphs
Linear Algebra and its ApplicationsWe introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Michael Braun +4 more
openaire +3 more sources
Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
05C50; 05E30; 51E05; Divisible design graph; Strongly regular graph; Symmetric ...
Gavrilyuk, Alexander L. +1 more
core +1 more source
On strongly regular graphs with μ≤2
, 2006 In this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and any strongly regular graph with μ=2 is either a grid graph or satisfies k⩾12λ(λ+3).
Bagchi, Bhaskar
core +1 more source
Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface
FEBS Open Bio, EarlyView.HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana +5 more
wiley +1 more source
On strongly regular graphs [PDF]
, 2009 Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non-adjacent. From an algebraic point of view, a graph is strongly regular
Behbahani, Majid
core +1 more source