Results 61 to 70 of about 302,520 (264)

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Identification of a Shiga toxin A‐derived peptide internalized into Gb3 receptor‐bearing cells via interaction with the Shiga toxin B subunit

open access: yesFEBS Letters, EarlyView.
The process of internalization of the Shiga toxin A subunit via formation of a complex with the Shiga toxin B subunit, which specifically binds to the Gb3 receptor. The peptide is designed to act as a carrier of drugs into cancer cells. Here, we explored the potential of peptides derived from the catalytic A subunit of Shiga toxin (STxA) to be drug ...
Giulia Opassi   +6 more
wiley   +1 more source

Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix

open access: yesJournal of Engineering, 2016
the encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure.
Mohammed Kasim Mohammed Al-Haddad
doaj   +2 more sources

Toeplitz matrix completion via a low-rank approximation algorithm

open access: yesJournal of Inequalities and Applications, 2020
In this paper, we propose a low-rank matrix approximation algorithm for solving the Toeplitz matrix completion (TMC) problem. The approximation matrix was obtained by the mean projection operator on the set of feasible Toeplitz matrices for every ...
Ruiping Wen, Yaru Fu
doaj   +1 more source

Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions

open access: yesFEBS Letters, EarlyView.
The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang   +4 more
wiley   +1 more source

Proximal iteratively reweighted algorithm for low-rank matrix recovery

open access: yesJournal of Inequalities and Applications, 2018
This paper proposes a proximal iteratively reweighted algorithm to recover a low-rank matrix based on the weighted fixed point method. The weighted singular value thresholding problem gains a closed form solution because of the special properties of ...
Chao-Qun Ma, Yi-Shuai Ren
doaj   +1 more source

What is the Rank of the Demjanenko Matrix?

open access: yesJournal of Symbolic Computation, 1987
The paper poses three questions about the rank of the Demjanenko matrix, gives a lower estimate for the rank and present some computer calculations.
H. G. Folz, Horst G. Zimmer
openaire   +2 more sources

An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes

open access: yesFEBS Letters, EarlyView.
GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg   +14 more
wiley   +1 more source

Robust low-rank abundance matrix estimation for hyperspectral unmixing

open access: yesThe Journal of Engineering, 2019
Hyperspecral unmixing (HU) is one of the crucial steps of hyperspectral image (HSI) processing. The process of HU can be divided into end-member extraction and abundance estimation.
Fan Feng   +4 more
doaj   +1 more source

Testing Matrix Rank, Optimally [PDF]

open access: yes, 2019
We show that for the problem of testing if a matrix $A \in F^{n \times n}$ has rank at most $d$, or requires changing an $ε$-fraction of entries to have rank at most $d$, there is a non-adaptive query algorithm making $\widetilde{O}(d^2/ε)$ queries. Our algorithm works for any field $F$. This improves upon the previous $O(d^2/ε^2)$ bound (SODA'03), and
Maria-Florina Balcan   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy