Results 61 to 70 of about 236,217 (313)

Algorithmic statistics: forty years later [PDF]

open access: yes, 2017
Algorithmic statistics has two different (and almost orthogonal) motivations. From the philosophical point of view, it tries to formalize how the statistics works and why some statistical models are better than others. After this notion of a "good model"
A Milovanov   +32 more
core   +2 more sources

Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system

open access: yesFEBS Letters, EarlyView.
Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley   +1 more source

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

open access: yesMolecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice   +16 more
wiley   +1 more source

Theories for TC0 and Other Small Complexity Classes [PDF]

open access: yesLogical Methods in Computer Science, 2006
We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers.
Phuong Nguyen, Stephen Cook
doaj   +1 more source

On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs

open access: yes, 2021
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, we ask whether it is possible to reduce the randomness complexity, R, of the verifier to be comparable with the number of bits, C_V, that the verifier sends during the interaction.
Applebaum, Benny, Golombek, Eyal
openaire   +3 more sources

Cell surface interactome analysis identifies TSPAN4 as a negative regulator of PD‐L1 in melanoma

open access: yesMolecular Oncology, EarlyView.
Using cell surface proximity biotinylation, we identified tetraspanin TSPAN4 within the PD‐L1 interactome of melanoma cells. TSPAN4 negatively regulates PD‐L1 expression and lateral mobility by limiting its interaction with CMTM6 and promoting PD‐L1 degradation.
Guus A. Franken   +7 more
wiley   +1 more source

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras [PDF]

open access: yesTheoretiCS
This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to study the CSP ...
Libor Barto   +4 more
doaj   +1 more source

Perfect zero knowledge for quantum multiprover interactive proofs

open access: yes, 2019
In this work we consider the interplay between multiprover interactive proofs, quantum entanglement, and zero knowledge proofs - notions that are central pillars of complexity theory, quantum information and cryptography.
Grilo, Alex B.   +2 more
core   +3 more sources

Information Sets of Multiplicity Codes [PDF]

open access: yes, 2015
We here provide a method for systematic encoding of the Multiplicity codes introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built on an idea of Kop-party. We properly define information sets for these codes and give detailed proofs
Augot, Daniel   +2 more
core   +4 more sources

Phenotypic and genotypic characterization of single circulating tumor cells in the follow‐up of high‐grade serous ovarian cancer

open access: yesMolecular Oncology, EarlyView.
Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy