Results 81 to 90 of about 29,610 (306)

Cyclotomic Trace Codes

open access: yesAlgorithms, 2019
A generalization of Ding’s construction is proposed that employs as a defining set the collection of the sth powers ( s ≥ 2 ) of all nonzero elements in G F ( p m ) , where p ≥ 2 is prime.
Dean Crnković   +2 more
doaj   +1 more source

Microglial dynamics and ferroptosis induction in human iPSC‐derived neuron–astrocyte–microglia tri‐cultures

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

Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks

open access: yesMolecules, 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

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

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

Transitive combinatorial structures invariant under some subgroups of S(6,2) and related codes

open access: yesAtti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018
In this paper we define combinatorial structures on the conjugacy classes of the maximal subgroups of the symplectic group S(6,2) under the action of two subgroups of S(6,2) isomorphic to U(3,3) or U(4,2).
Dean Crnković   +2 more
doaj   +1 more source

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

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

Self-Dual and LCD Codes from Kneser Graphs K(n, 2) and Generalized Quadrangles

open access: yesMathematics
In this paper, we study self-dual and LCD codes constructed from Kneser graphs K(n, 2) and collinearity graphs of generalized quadrangles using the so-called pure and bordered construction. We determine conditions under which these codes are self-dual or
Dean Crnković, Ana Grbac
doaj   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

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

Some New Cyclotomic Strongly Regular Graphs [PDF]

open access: yesJournal of Algebraic Combinatorics, 1995
Given a field \(F\) and a subset \(D\) of \(F^*\) such that \(D= -D\), one can define a graph \(\Gamma\) with vertex set \(F\) by letting \(x\sim y\) whenever \(y- x\in D\). Several authors have studied the problem of finding sets \(D\) such that the graph \(\Gamma\) is strongly regular and many examples are known.
openaire   +2 more sources

Home - About - Disclaimer - Privacy