Results 81 to 90 of about 1,437,003 (280)

RaMBat: Accurate identification of medulloblastoma subtypes from diverse data sources with severe batch effects

Molecular Oncology, EarlyView.
To integrate multiple transcriptomics data with severe batch effects for identifying MB subtypes, we developed a novel and accurate computational method named RaMBat, which leveraged subtype‐specific gene expression ranking information instead of absolute gene expression levels to address batch effects of diverse data sources.
Mengtao Sun, Jieqiong Wang, Shibiao Wan
wiley   +1 more source

Depth lower bounds in Stabbing Planes for combinatorial principles [PDF]

Logical Methods in Computer Science
Stabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables.
Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin   +3 more
doaj   +1 more source

Why Philosophers Should Care About Computational Complexity [PDF]

, 2011
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong.
Aaronson, Scott
core   +4 more sources

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

Molecular 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, Lyanne Delgado‐Coka, Natalia Marchenko, Luisa F. Escobar‐Hoyos, Kenneth R. Shroyer, Alisa Yurovsky, Trey Ideker, Gábor Balázsi, Thomas MacCarthy, Scott Powers   +9 more
wiley   +1 more source

Low Complexity V-BLAST MIMO-OFDM Detector by Successive Iterations Reduction

, 2015
V-BLAST detection method suffers large computational complexity due to its successive detection of symbols. In this paper, we propose a modified V-BLAST algorithm to decrease the computational complexity by reducing the number of detection iterations ...
Abuelenin, Sherif, Ahmed, Karam, Al-Barbary, Khairy, Soliman, Heba   +3 more
core   +2 more sources

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

Molecular 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, Madeleine Birgersson, Paolo Ceriani, Margareta Wilhelm, Ourania N Kostopoulou   +4 more
wiley   +1 more source

Functional impact of multi-omic interactions in lung cancer

Frontiers in Genetics
Lung tumors are a leading cause of cancer-related death worldwide. Lung cancers are highly heterogeneous on their phenotypes, both at the cellular and molecular levels.
Miguel Ángel Díaz-Campos, Jorge Vasquez-Arriaga, Soledad Ochoa, Soledad Ochoa, Enrique Hernández-Lemus, Enrique Hernández-Lemus   +5 more
doaj   +1 more source

Computer science, computer, computational complexity

Chebyshevskii sbornik, 2021
Vladimir Nikolaevich Chubarikov, Nikolai Nikolaevich Dobrovol’skii, Irina Yurievna Rebrova, Nikolai Mihailovich Dobrovol’skii   +3 more
openaire   +2 more sources

Computational Complexity of the Interleaving Distance

, 2018
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings.
Bjerkevik, Håvard Bakke, Botnan, Magnus Bakke   +1 more
core  

The Computational Complexity of the Traveling Salesman Problem [PDF]

, 2011
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.Comment: 1 page, made a minor ...
Feinstein, Craig Alan
core   +2 more sources