Results 81 to 90 of about 1,395,371 (292)

Functional impact of multi-omic interactions in lung cancer

open access: yesFrontiers 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   +5 more
doaj   +1 more source

The Computational Complexity of the Traveling Salesman Problem [PDF]

open access: yes, 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

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

On the Complexity of Target Set Selection in Simple Geometric Networks [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual
Michal Dvořák   +2 more
doaj   +1 more source

Computational Complexity of the Interleaving Distance

open access: yes, 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   +1 more
core  

Applying computational complexity to the emergence of classicality [PDF]

open access: yes, 2013
Can the computational complexity theory of computer science and mathematics say something new about unresolved problems in quantum physics? Particularly, can the P versus NP question in the computational complexity theory be a factor in the elucidation ...
Bolotin, Arkady
core  

Effective therapeutic targeting of CTNNB1‐mutant hepatoblastoma with WNTinib

open access: yesMolecular Oncology, EarlyView.
WNTinib, a Wnt/CTNNB1 inhibitor, was tested in hepatoblastoma (HB) experimental models. It delayed tumor growth and improved survival in CTNNB1‐mutant in vivo models. In organoids, WNTinib outperformed cisplatin and showed enhanced efficacy in combination therapy, supporting its potential as a targeted treatment for CTNNB1‐mutated HB.
Ugne Balaseviciute   +17 more
wiley   +1 more source

Master Regulators of Signaling Pathways: An Application to the Analysis of Gene Regulation in Breast Cancer

open access: yesFrontiers in Genetics, 2019
Analysis of gene regulatory networks allows the identification of master transcriptional factors that control specific groups of genes. In this work, we inferred a gene regulatory network from a large dataset of breast cancer samples to identify the ...
Diana Tapia-Carrillo   +5 more
doaj   +1 more source

Transcriptional regulation of neuropeptide receptors underlies context‐dependent adaptation in Drosophila melanogaster

open access: yesFEBS Open Bio, EarlyView.
Under environmental changes, the expression level of neuropeptide (NP) and neuropeptide receptor (NPR) genes changes to confer context‐dependent adaptation to the model organism Drosophila melanogaster. Through finding more regulatory elements in the NPR genes in comparison with their ligands (NPs), we found that NPR‐biased transcriptional regulation ...
SeungHeui Ryu   +6 more
wiley   +1 more source

The computational complexity of convex bodies

open access: yes, 2006
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in d).
Barvinok, Alexander, Veomett, Ellen
core   +1 more source

Home - About - Disclaimer - Privacy