Results 121 to 130 of about 4,256 (307)

MiR‐513a promotes human erythroid differentiation by modulating c‐Jun

open access: yesFEBS Open Bio, EarlyView.
During early human erythropoiesis, miR‐513a promoted erythroid differentiation in primary human CD34+ hematopoietic stem‐progenitor cells and human TF‐1 erythroleukemic cells by indirectly decreasing c‐Jun and phospho‐c‐Jun expression, which are associated with increased GATA1 expression.
MinJung Kim   +11 more
wiley   +1 more source

Total Graph Interpretation of the Numbers of the Fibonacci Type

open access: yesJournal of Applied Mathematics, 2015
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give
Urszula Bednarz   +2 more
doaj   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

open access: yesFEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong   +3 more
wiley   +1 more source

Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins

open access: yesFEBS Open Bio, EarlyView.
Endogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Keiichi Ikeda
wiley   +1 more source

A survey of two-dimensional graph layout techniques for information visualisation [PDF]

open access: yes, 2012
Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core   +1 more source

Treatment with KCL‐286, a first‐in‐class retinoic acid receptor‐β (RARβ) agonist, ameliorates neuronal DNA damage and inflammation in a mouse model of Alzheimer's disease

open access: yesFEBS 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

A Note on Graphs of $k$-Colourings

open access: yesThe Electronic Journal of Combinatorics
For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings, and has been extensively studied from both extremal and probabilistic perspectives.
Hogan, E   +3 more
openaire   +4 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

Graph marking game and graph colouring game [PDF]

open access: yes, 2005
This thesis discusses graph marking game and graph colouring game. Suppose G=(V, E) is a graph. A marking game on G is played by two players, Alice and Bob, with Alice playing first. At the start of the game all vertices are unmarked.
Wu, Jiaojiao
core  

Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms [PDF]

open access: yes, 2011
It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy