Results 71 to 80 of about 12,027 (259)
This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source
Blockwise Repeated Burst Error Correcting Linear Codes
This paper presents a lower and an upper bound on the number of parity check digits required for a linear code that corrects a single sub-block containing errors which are in the form of 2-repeated bursts of length b or less. An illustration of such kind
B.K. Dass, Surbhi Madan
doaj
Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill +6 more
wiley +1 more source
Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations
Perfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory.
Pedro-José Cazorla García
doaj +1 more source
Evolution‐guided yeast complementation reveals functional differences in human PSPH variants
Ancient genomes can help guide which human genetic variants are tested experimentally. This study applies that idea to PSPH, a gene involved in serine biosynthesis, and uses high‐throughput yeast complementation to compare variant function. The findings reveal measurable differences among selected alleles and illustrate the value of evolution‐guided ...
Mauricio Campa‐Álvarez +6 more
wiley +1 more source
Error correcting codes and heterotic Narain CFTs
We study error correcting codes that construct the Narain lattices of heterotic strings as code lattices. We identify, in both E 8 × E 8 and Spin(32)/ℤ2 heterotic strings, a pair of a binary code and a set of the corresponding metric, B field, and ...
Shun’ya Mizoguchi, Takumi Oikawa
doaj +1 more source
Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty +13 more
wiley +1 more source
Efficiently stable presentations from error-correcting codes
This paper brings together a wide variety of interesting concepts, in order to rederive a result that formed a key step in the proof of the famous result that MIP${\mathstrut}^*$=RE by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry ...
Michael Chapman +2 more
doaj +1 more source
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen +5 more
wiley +1 more source
Group Homomorphisms as Error Correcting Codes [PDF]
We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups $G$ and $H$. We prove some general structural results on how the distance behaves with respect to natural group operations, such as passing to subgroups and quotients, and taking products.
openaire +5 more sources

