Results 61 to 70 of about 27,920 (229)
Exploration of heterogeneity and recurrence signatures in hepatocellular carcinoma
This study leveraged public datasets and integrative bioinformatic analysis to dissect malignant cell heterogeneity between relapsed and primary HCC, focusing on intercellular communication, differentiation status, metabolic activity, and transcriptomic profiles.
Wen‐Jing Wu+15 more
wiley +1 more source
Presents a critical analysis of Hayek in the light of modern computability and economic computability theory.Hayek, Computability ...
Cockshott, W. Paul, Cottrell, Allin
core +1 more source
Integrating ancestry, differential methylation analysis, and machine learning, we identified robust epigenetic signature genes (ESGs) and Core‐ESGs in Black and White women with endometrial cancer. Core‐ESGs (namely APOBEC1 and PLEKHG5) methylation levels were significantly associated with survival, with tumors from high African ancestry (THA) showing ...
Huma Asif, J. Julie Kim
wiley +1 more source
Computational Irreducibility and Computational Analogy [PDF]
11 ...
openaire +4 more sources
There is an unmet need in metastatic breast cancer patients to monitor therapy response in real time. In this study, we show how a noninvasive and affordable strategy based on sequencing of plasma samples with longitudinal tracking of tumour fraction paired with a statistical model provides valuable information on treatment response in advance of the ...
Emma J. Beddowes+20 more
wiley +1 more source
Quantum randomness and value indefiniteness
As computability implies value definiteness, certain sequences of quantum outcomes cannot be computable.Comment: 13 pages ...
Calude, Cristian S., Svozil, Karl
core +3 more sources
Loss of the frequently mutated chromatin remodeler ARID1A, a subunit of the SWI/SNF cBAF complex, results in less open chromatin, alternative splicing, and the failure to stop cells from progressing through the cell cycle after DNA damage in bladder (cancer) cells. Created in BioRender. Epigenetic regulators, such as the SWI/SNF complex, with important
Rebecca M. Schlösser+11 more
wiley +1 more source
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated.
Duda, Karol
core
Computing with Functionals—Computability Theory or Computer Science?
AbstractWe review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science have shaped this still active subject.
openaire +3 more sources