Results 41 to 50 of about 131,990 (294)
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
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
Entropy Coding Aided Adaptive Subcarrier-Index Modulated OFDM
We propose entropy coding-aided adaptive subcarrier-index-modulated orthogonal frequency division multiplexing (SIM-OFDM). In conventional SIM-OFDM, the indices of the subcarriers activated are capable of conveying extra information. We propose the novel
Mohammad Ismat Kadir +3 more
doaj +1 more source
"Graph Entropy, Network Coding and Guessing games" [PDF]
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the number
RIIS, SM
core +3 more sources
Bounds on Information Combining With Quantum Side Information
"Bounds on information combining" are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways.
Hirche, Christoph, Reeb, David
core +1 more source
Fast Relative Entropy Coding with A* coding
Relative entropy coding (REC) algorithms encode a sample from a target distribution $Q$ using a proposal distribution $P$, such that the expected codelength is $\mathcal{O}(D_{KL}[Q \,||\, P])$. REC can be seamlessly integrated with existing learned compression models since, unlike entropy coding, it does not assume discrete $Q$ or $P$, and does not ...
Flamich, Gergely +2 more
openaire +2 more sources
We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
Entropy of Neuronal Spike Patterns
Neuronal spike patterns are the fundamental units of neural communication in the brain, which is still not fully understood. Entropy measures offer a quantitative framework to assess the variability and information content of these spike patterns.
Artur Luczak
doaj +1 more source
Entropy Approximation in Lossy Source Coding Problem
In this paper, we investigate a lossy source coding problem, where an upper limit on the permitted distortion is defined for every dataset element. It can be seen as an alternative approach to rate distortion theory where a bound on the allowed average ...
Marek Śmieja, Jacek Tabor
doaj +1 more source
Optimal dense coding with mixed state entanglement [PDF]
I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved.
+6 more
core +2 more sources

