Results 51 to 60 of about 258,202 (236)
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
Joint Source-Channel Decoding of Polar Codes for Language-Based Source
We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after every few bits ...
Bandic, Zvonimir +4 more
core +1 more source
This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Inhibition of CDK9 enhances AML cell death induced by combined venetoclax and azacitidine
The CDK9 inhibitor AZD4573 downregulates c‐MYC and MCL‐1 to induce death of cytarabine (AraC)‐resistant AML cells. This enhances VEN + AZA‐induced cell death significantly more than any combination of two of the three drugs in AraC‐resistant AML cells.
Shuangshuang Wu +18 more
wiley +1 more source
Information Compression, Intelligence, Computing, and Mathematics [PDF]
This paper presents evidence for the idea that much of artificial intelligence, human perception and cognition, mainstream computing, and mathematics, may be understood as compression of information via the matching and unification of patterns.
Wolff, J. Gerard
core
On the Number of Errors Correctable with Codes on Graphs
We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs.
Barg, Alexander, Mazumdar, Arya
core +1 more source
MDS and AMDS symbol-pair codes are constructed from repeated-root codes
27 pages.
Tang, Xiuxin, Luo, Rong
openaire +2 more sources
This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source
Self-dual repeated root cyclic and negacyclic codes over finite fields [PDF]
In this paper we investigate repeated root cyclic and negacyclic codes of length $p^rm$ over $\mathbb{F}_{p^s}$ with $(m,p)=1$. In the case $p$ odd, we give necessary and sufficient conditions on the existence of negacyclic self-dual codes. When $m=2m'$ with $m'$ odd, we characterize the codes in terms of their generator polynomials.
Guenda, Kenza, Gulliver, T. Aaron
openaire +2 more sources
This study characterizes the responses of primary acute myeloid leukemia (AML) patient samples to the MCL‐1 inhibitor MIK665. The results revealed that monocytic differentiation is associated with MIK665 sensitivity. Conversely, elevated ABCB1 expression is a potential biomarker of resistance to the treatment, which can be overcome by the combination ...
Joseph Saad +17 more
wiley +1 more source

