Results 71 to 80 of about 1,450,191 (282)

Injecting Observers into Computational Complexity

open access: yesPhilosophies
We characterize computer science as an interplay between two modes of reasoning: the Aristotelian (procedural) method and the Platonic (declarative) approach.
Edgar Graham Daylight
doaj   +1 more source

On computational complexity of Siegel Julia sets

open access: yes, 2005
It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification.
Binder, I., Braverman, M., Yampolsky, M.
core   +1 more source

Tumor mutational burden as a determinant of metastatic dissemination patterns

open access: yesMolecular Oncology, EarlyView.
This study performed a comprehensive analysis of genomic data to elucidate whether metastasis in certain organs share genetic characteristics regardless of cancer type. No robust mutational patterns were identified across different metastatic locations and cancer types.
Eduardo Candeal   +4 more
wiley   +1 more source

Probabilistic Recursion Theory and Implicit Computational Complexity [PDF]

open access: yesScientific Annals of Computer Science, 2014
We show that probabilistic computable functions, i.e., those func- tions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene’s partial recursive functions.
U. Dal Lago, S. Zuppiroli, M. Gabbrielli
doaj   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Special Issue on Reconfiguration Problems

open access: yesAlgorithms, 2018
The study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions.
Faisal Abu-Khzam   +2 more
doaj   +1 more source

On sample complexity for computational pattern recognition

open access: yes, 2005
In statistical setting of the pattern recognition problem the number of examples required to approximate an unknown labelling function is linear in the VC dimension of the target learning class.
Ryabko, Daniil
core   +1 more source

Dual PI3K/AKT and CDK4/6 inhibition reveals selective sensitivity in an SHH medulloblastoma stem cell model

open access: yesMolecular Oncology, EarlyView.
Targeted therapy was evaluated in SHH medulloblastoma using neuroepithelial stem cell (NES) and tumor‐derived NES‐like (tNES) models in 2D monolayers and 3D spheroids. PI3K, AKT, and CDK4/6 inhibitors had minimal effects in NES but markedly reduced viability and growth and induced apoptosis in tNES cells, revealing distinct therapeutic vulnerabilities.
Monika Lukoseviciute   +4 more
wiley   +1 more source

The Computational Complexity of Generating Random Fractals

open access: yes, 1995
In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation.
A. Coniglio   +34 more
core   +2 more sources

Mycobacterial cell division arrest and smooth‐to‐rough envelope transition using CRISPRi‐mediated genetic repression systems

open access: yesFEBS Open Bio, EarlyView.
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy