Results 51 to 60 of about 2,216,193 (279)
FEBS Letters, EarlyView.This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source
Optimal Locally Repairable Linear Codes [PDF]
, 2013 Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \delta})-locality, denoted as (r, {\delta})a, is considered optimal if it also meets the minimum Hamming distance ...
Dau, Son Hoang +3 more
core
, 2016 For a code $\code$, its $i$-th symbol is said to have locality $r$ if its value can be recovered by accessing some other $r$ symbols of $\code$. Locally repairable codes (LRCs) are the family of codes such that every symbol has locality $r$.
Kadhe, Swanand, Sprintson, Alex
core +1 more source
Polycyclic Codes and Their Application in Constructing AEAQECCs
AxiomsIn this article, we study polycyclic codes over the ring R=Fq[v]/⟨v2−1⟩, where q=pm with p being an odd prime. First, we introduce polycyclic codes and sequential codes over R, and characterize the structural properties of these polycyclic codes.
Juan Li, Yunbo Tian, Fanghui Ma
doaj +1 more source
Non-binary quantum codes from constacyclic codes over 𝔽q[u1, u2,…,uk]/⟨ui3 = ui, uiuj = ujui⟩
Open Mathematics, 2022 Let q=pmq={p}^{m}, pp be an odd prime, and Rk=Fq[u1,u2,…,uk]/⟨ui3=ui,uiuj=ujui⟩{R}_{k}={{\mathbb{F}}}_{q}\left[{u}_{1},{u}_{2},\ldots ,{u}_{k}]\hspace{-0.08em}\text{/}\hspace{-0.08em}\langle {u}_{i}^{3}={u}_{i},{u}_{i}{u}_{j}={u}_{j}{u}_{i}\rangle ...
Kong Bo, Zheng Xiying
doaj +1 more source
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m
IEEE Access, 2022 Let $p\not =5$ be any odd prime. Using the algebraic structures of all cyclic codes of length $5p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , in this paper, the exact values of Hamming ...
Hai Q. Dinh +3 more
doaj +1 more source
Chinese Science Bulletin, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.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
Constructions of Polynomial Codes Based on Circular Permutation Over Finite Fields
IEEE Access, 2020 As a kind of very important error-correcting codes, polynomial codes have the advantages of good performance and simple structure. Generalized R-S codes over $F_{q}$ as polynomial codes have the advantages described above, but their lengths $n$ are ...
Xiuli Wang, Yakun Hao, Dan Qiao
doaj +1 more source