Results 131 to 140 of about 96,525 (309)

Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
The block graph of a quasi-symmetric design is strongly regular. It is a challenging problem to decide which strongly regular graphs are block graphs of quasi-symmetric designs.
Kusum S. Rajbhar, Rajendra M. Pawale
doaj   +1 more source

Graph Regularized PCA

open access: yesCoRR
15 pages, 2 figures, 4 ...
Antonio Briola   +6 more
openaire   +2 more sources

YIPFα1A expression is regulated by multilayered molecular mechanisms

open access: yesFEBS Open Bio, EarlyView.
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji   +2 more
wiley   +1 more source

Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens

open access: yesFEBS Open Bio, EarlyView.
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee   +3 more
wiley   +1 more source

Cycle-regular graphs

open access: yesDiscrete Mathematics, 1991
AbstractH.M. Mulder introduced (0,λ)-graphs and proved that maximum (0,λ)-graphs are hypercubes. One way of generalization of this concept is to consider cycle-regular graphs. We prove that these graphs have also some regularity properties and that maximum [3, 1, 6]-cycle regular graphs are also related to hypercubes.
openaire   +1 more source

Spectral Characterization of the Hamming Graphs

open access: yes
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core  

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

More about Divisible Design Graphs

open access: yes
: Divisible design graphs (DDG for short) have been recently defined by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs.
Haemers, W.H., Crnkovic, D.
core  

Most switching classes with primitive automorphism groups contain graphs with trivial groups

open access: yes, 2015
The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged.
Cameron, Peter Jephson, Spiga, Pablo
core  

Time‐restricted feeding prior to Mycobacterium tuberculosis infection reduces tissue CD4+ T cells with limited impact on bacterial clearance

open access: yesFEBS Open Bio, EarlyView.
Time‐restricted feeding (TRF) in mice increased liver fatty acid oxidation and decreased fatty acid biosynthesis. These alterations persisted when TRF was discontinued and the host was infected with Mycobacterium tuberculosis. Pre‐exposure to TRF did not alter tissue (lung and spleen) mycobacterial burden but significantly reduced CD3+ T cells in lungs
Ashish Gupta   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy