Results 81 to 90 of about 370,627 (270)
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
AKCE International Journal of Graphs and CombinatoricsThe 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
FEBS Open Bio, EarlyView.CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
Fault-tolerant quantum speedup from constant depth quantum circuits
Physical Review Research, 2020 A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task.
Rawad Mezher +3 more
doaj +1 more source
Random strongly regular graphs? [PDF]
Electronic Notes in Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
FEBS Open Bio, EarlyView.A tri‐culture of iPSC‐derived neurons, astrocytes, and microglia treated with ferroptosis inducers as an Induced ferroptosis model was characterized by scRNA‐seq, cell survival, and cytokine release assays. This analysis revealed diverse microglial transcriptomic changes, indicating that the system captures key aspects of the complex cellular ...
Hongmei Lisa Li +6 more
wiley +1 more source
Hemisystems and strongly regular graphs
Discrete Applied MathematicsIn a recent paper, it was constructed a family of hemisystems of H(3,p2), for every prime p of the form p=1+4a2, stabilised by PSL(2,p)×C[Formula presented]. In the case p=5, the full automorphism group is 3.A7, and the hemisystem is isomorphic to a sporadic one described by A. Cossidente and T. Penttila in 2005.
Pallozzi Lavorante V. +2 more
openaire +1 more source
Disconnecting strongly regular graphs
European Journal of Combinatorics, 2014 In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner $2$-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are ...
Sebastian M. Cioabă +2 more
openaire +2 more sources
FEBS Open Bio, EarlyView.Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Molecules, 2017 Network motifs are patterns of complex networks occurring significantly more frequently than those in random networks. They have been considered as fundamental building blocks of complex networks.
Jialu Hu, Xuequn Shang
doaj +1 more source