Results 81 to 90 of about 1,379,053 (353)

Machine learning for identifying liver and pancreas cancers through comprehensive serum glycopeptide spectra analysis: a case‐control study

open access: yesMolecular Oncology, EarlyView.
This study presents a novel AI‐based diagnostic approach—comprehensive serum glycopeptide spectra analysis (CSGSA)—that integrates tumor markers and enriched glycopeptides from serum. Using a neural network model, this method accurately distinguishes liver and pancreatic cancers from healthy individuals.
Motoyuki Kohjima   +6 more
wiley   +1 more source

Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime [PDF]

open access: yes, 2012
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are known to map ...
Kawamura, Akitoshi   +3 more
core  

Decrypting cancer's spatial code: from single cells to tissue niches

open access: yesMolecular Oncology, EarlyView.
Spatial transcriptomics maps gene activity across tissues, offering powerful insights into how cancer cells are organised, switch states and interact with their surroundings. This review outlines emerging computational, artificial intelligence (AI) and geospatial approaches to define cell states, uncover tumour niches and integrate spatial data with ...
Cenk Celik   +4 more
wiley   +1 more source

Toward A Better Understanding of Perceived Complexity in Music: A Commentary on Eerola (2016)

open access: yesEmpirical Musicology Review, 2016
Eerola (2016) evaluates models of musical complexity based on expectancy violation and information theory. This commentary notes the deep relationship between these two phenomena, and argues for a more active partnership between computational and ...
Elizabeth Hellmuth Margulis
doaj   +1 more source

Note on stability and holographic subregion complexity

open access: yesEuropean Physical Journal C: Particles and Fields, 2022
We study holographic subregion complexity in a spatially anisotropic field theory, which expresses a confinement-deconfinement phase transition. Its holographic dual is a five-dimensional anisotropic holographic model characterized by a Van der Waals ...
Mohammad Ali-Akbari, Mahsa Lezgi
doaj   +1 more source

Interactions of computational complexity theory and mathematics

open access: yes, 2023
$ $[This paper is a (self contained) chapter in a new book, Mathematics and Computation, whose draft is available on my homepage at https://www.math.ias.edu/avi/book ]. We survey some concrete interaction areas between computational complexity theory and different fields of mathematics.
openaire   +2 more sources

A bioinformatics screen identifies TCF19 as an aggressiveness‐sustaining gene in prostate cancer

open access: yesMolecular Oncology, EarlyView.
Gene expression meta‐analysis in multiple prostate cancer patient cohorts identifies Transcription factor 19 (TCF19) as an aggressiveness‐sustaining gene with prognostic potential. TCF19 is a gene repressed by androgen signaling that sustains core cancer‐related processes such as vascular permeability or tumor growth and metastasis.
Amaia Ercilla   +15 more
wiley   +1 more source

Volume and complexity for Warped AdS black holes

open access: yesJournal of High Energy Physics, 2018
We study the Complexity=Volume conjecture for Warped AdS3 black holes. We compute the spatial volume of the Einstein-Rosen bridge and we find that its growth rate is proportional to the Hawking temperature times the Bekenstein-Hawking entropy.
Roberto Auzzi   +2 more
doaj   +1 more source

A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression

open access: yesMolecular Oncology, EarlyView.
Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak   +8 more
wiley   +1 more source

On the computational complexity of the theory of Abelian groups

open access: yesAnnals of Pure and Applied Logic, 1988
Using the Ehrenfeucht games method, the decidability and complexity of the following first-order theories is obtained: the theory of the divisible and indecomposable p-groups, the theory of the groups of rational numbers with denominators prime to p, the theory of cyclic groups of prime power order, the theory of direct sums of countably many infinite ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy