Results 61 to 70 of about 13,649 (264)
Entropic Bounds on the Average Length of Codes with a Space
We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average ...
Roberto Bruno, Ugo Vaccaro
doaj +1 more source
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on
Hong-Li Wang, Gang Wang, You Gao
doaj +1 more source
Translophagy—A potential link between autophagy impairment and translational errors
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk +11 more
wiley +1 more source
The Divisible Code Bound Revisited
A linear code over \(\text{GF}(q)\) is called divisible if the weights of its codewords have a common divisor \(\Delta > 1\). If \(\Delta\) is relatively prime to \(q\), the code is essentially a \(\Delta\)-fold replicated code. So the case of interest is when the characteristic \(p\) divides \(\Delta\). The author gives a new, character-free proof for
openaire +1 more source
Structural and biochemical analysis of a B12 superbinder
BtuG proteins are vitamin B12 scavengers in Bacteroides thetaiotaomicron, a dominant human gut bacterium. We present crystal structures of three BtuG homologs bound to cobalamin and its precursor cobinamide, revealing picomolar binding affinities, among the highest known for any natural protein.
Jose M. Martinez Felices +3 more
wiley +1 more source
Mycobacterial 3‐methylcrotonyl‐CoA carboxylase uses a mobile biotin‐carrying domain to shuttle a carboxyl group between two catalytic sites, enabling carboxylation of 3‐methylcrotonyl‐CoA during leucine breakdown. Cryo‐electron microscopy captures the carrier at both sites and reveals an inward loop movement that may prevent futile rebinding to the ...
Ajit Yadav +2 more
wiley +1 more source
Short barcodes for next generation sequencing. [PDF]
We consider the design and evaluation of short barcodes, with a length between six and eight nucleotides, used for parallel sequencing on platforms where substitution errors dominate.
Katharina Mir +3 more
doaj +1 more source
In this paper, we study linear codes capable of detecting and correcting s-periodic errors. Lower and upper bounds on the number of parity check digits required for codes detecting such errors are obtained.
Pankaj Kumar Das, Vinod Tyagi
doaj
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
Gray codes with bounded weights
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomás Dvorák +3 more
openaire +3 more sources

