Results 111 to 120 of about 2,975,002 (298)
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core
Distributed Graph Simulation: Impossibility and Possibility [PDF]
, 2014 This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
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
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
FEBS 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
Classification of some strongly regular subgraphs of the McLaughlin graph [PDF]
, 2008 By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v,k,λ,μ)=(105,32,4,12), (120,42,8,18) and (176,70,18,34) are unique up to isomorphism.
Degraer, J. +5 more
core +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
FEBS 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
FEBS Open Bio, EarlyView.In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin +12 more
wiley +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source