Results 81 to 90 of about 1,450,191 (282)

Methods for multi-omic data integration in cancer research

open access: yesFrontiers in Genetics
Multi-omics data integration is a term that refers to the process of combining and analyzing data from different omic experimental sources, such as genomics, transcriptomics, methylation assays, and microRNA sequencing, among others.
Enrique Hernández-Lemus   +3 more
doaj   +1 more source

Constructive Separations and Their Consequences [PDF]

open access: yesTheoretiCS
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$.
Lijie Chen   +3 more
doaj   +1 more source

A Computable Economist’s Perspective on Computational Complexity [PDF]

open access: yes, 2007
A computable economist's view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role.
Vela Velupillai, K.
core  

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

open access: yesFEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei   +3 more
wiley   +1 more source

Chameleon sequences reveal structural effects in proteins representing micelle‐like distribution of hydrophobicity

open access: yesFEBS Open Bio, EarlyView.
Amino acids sequence of two different proteins with the same sequence (chameleon sequence—black boxes) represent in 3D structure of the proteins different secondary structures: HHHH—helical and BBB—Beta‐structural. The chains folded in water environment adopt different III‐order structures in which the chameleon fragments appear to adopt similar status
Irena Roterman   +4 more
wiley   +1 more source

Why Philosophers Should Care About Computational Complexity [PDF]

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

Computational Complexity of Atomic Chemical Reaction Networks

open access: yes, 2017
Informally, a chemical reaction network is "atomic" if each reaction may be interpreted as the rearrangement of indivisible units of matter. There are several reasonable definitions formalizing this idea.
A Padirac   +28 more
core   +1 more source

Exon 7 splicing of ERα predicts poor prognosis and increases phenotypic heterogeneity in luminal a subtype breast cancer

open access: yesFEBS Open Bio, EarlyView.
ERα splice variant ERα∆7 lacks the C‐terminus, and its expression may change phenotypes of breast cancers. Our results showed that ERα∆7 is found in the luminal A subtype, and elevated ERα∆7 levels are linked to improved cell survival with lower proliferation and migration.
Long Wai Tsui   +10 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

Quantum computational complexity, Einstein's equations and accelerated expansion of the Universe

open access: yes, 2017
We study the relation between quantum computational complexity and general relativity. The quantum computational complexity is proposed to be quantified by the shortest length of geodesic quantum curves.
Ge, Xian-Hui, Wang, Bin
core   +1 more source

Home - About - Disclaimer - Privacy