Results 61 to 70 of about 36,289 (270)
Difference Balanced Functions and Their Generalized Difference Sets [PDF]
Difference balanced functions from $F_{q^n}^*$ to $F_q$ are closely related to combinatorial designs and naturally define $p$-ary sequences with the ideal two-level autocorrelation.
Pott, Alexander, Wang, Qi
core
Cell wall target fragment discovery using a low‐cost, minimal fragment library
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Bu tez Gruplara Bü lunebilen Tasarımlar (GDD'ler) uzerinedir. GDD'ler Kombina-oü ütoryel Tasarımlar Teorisindeki ana yapılardan birisidir. GDD'ler ilk defa 1975'deHanani tarafından tanımlanmıs ve o gunden bu yana mesala PBD, Frame ve BIBDş ügibi kombinatoryel yapıların insaasında sıkca kullanılmıstır.ş ş şBir GDD (X, G, B) uclusu ...
openaire +1 more source
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Structural biology of ferritin nanocages
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley +1 more source
More about Divisible Design Graphs [PDF]
: Divisible design graphs (DDG for short) have been recently defined by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs.
Crnkovic, D., Haemers, W.H.
core +1 more source
t-Divisible designs from imprimitive permutation groups
A \(t\)-divisible design \((t\)-DD) is known as a group divisible design if \(t=2\) and the size of a point class exceeds 1, and a \(t\)-DD is simply a \(t\)-design if a point class is of size 1. The author constructs \(t\)-DD's by means of \(R\)-permutation groups \((G,X,R)\), where \(R\) is an equivalence relation on the set \(X\) and \(G\) is an \(R\
openaire +1 more source
AZD9291 has shown promise in targeted cancer therapy but is limited by resistance. In this study, we employed metabolic labeling and LC–MS/MS to profile time‐resolved nascent protein perturbations, allowing dynamic tracking of drug‐responsive proteins. We demonstrated that increased NNMT expression is associated with drug resistance, highlighting NNMT ...
Zhanwu Hou +5 more
wiley +1 more source
Maximal arcs and group divisible designs [PDF]
The existence of maximal arcs of a certain type in symmetric designs is shown to yield semiregular group divisible designs whose duals are also semiregular group divisible. Two infinite families of such group divisible designs are constructed. The group divisible designs in these families are, in general, not symmetric.
openaire +2 more sources

