Results 81 to 90 of about 7,149,925 (323)
Geometry of the minimum distance
Abstract Let $${{\mathbb {K}}}$$ K be any field, let
Pawlina, John, Tohaneanu, Stefan
openaire +2 more sources
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
Calpain small subunit homodimerization is robust and calcium‐independent
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Miscorrection probability beyond the minimum distance [PDF]
The miscorrection probability of a list decoder is the probability that the decoder will have at least one non-causal codeword in its decoding sphere. Evaluating this probability is important when using a list-decoder as a conventional decoder since in ...
Bruck, Jehoshua, Cassuto, Yuval
core
Computing Extensions of Linear Codes
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented.
Grassl, Markus
core +1 more source
This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
Resolution of the Wicksell's equation by Minimum Distance Estimation
The estimation of the grain size in granular materials is usually performed by 2D observations. Unfolding the grain size distribution from apparent 2D sizes is commonly referred as the corpuscle problem.
Dorian Depriester, Régis Kubler
doaj +1 more source
Minimum distance estimation of ARFIMA processes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zevallos, M., Palma M., Wilfredo
openaire +4 more sources
The Minimum Distance Problem for Two-Way Entanglement Purification
Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting
Ambainis, Andris, Gottesman, Daniel
core +3 more sources
Diversity and complexity in neural organoids
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source

