Results 31 to 40 of about 1,450,191 (282)
Computational Oncology in the Multi-Omics Era: State of the Art
Frontiers in Oncology, 2020 Cancer is the quintessential complex disease. As technologies evolve faster each day, we are able to quantify the different layers of biological elements that contribute to the emergence and development of malignancies.
Guillermo de Anda-Jáuregui +3 more
doaj +1 more source
Frontiers in Immunology, 2018 Alkaline phosphatase (AP) is an enzyme that exhibits anti-inflammatory effects by dephosphorylating inflammation triggering moieties (ITMs) like bacterial lipopolysaccharides and extracellular nucleotides. AP administration aims to prevent and treat peri-
Alva Presbitero +8 more
doaj +1 more source
Natural complexity, computational complexity and depth [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2011 Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a typical system state or history starting from simple initial conditions.
openaire +3 more sources
Membrane Fission: A Computational Complexity Perspective [PDF]
, 2016 Membrane fission is a process by which a biological membrane is split into two new ones in the manner that the content of the initial membrane is separated and distributed between the new membranes.
Cormen +12 more
core +1 more source
Scientific Reports, 2017 Recently, growth mechanism of firms in complex business networks became new targets of scientific study owing to increasing availability of high quality business firms’ data.
Hayato Goto +4 more
doaj +1 more source
Performance of Some Estimators of Relative Variability
Frontiers in Applied Mathematics and Statistics, 2019 The classic coefficient of variation (CV) is the ratio of the standard deviation to the mean and can be used to compare normally distributed data with respect to their variability, this measure has been widely used in many fields. In the Social Sciences,
Raydonal Ospina +1 more
doaj +1 more source
The Computational Complexity of Propositional Cirquent Calculus [PDF]
, 2015 Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Bauer, Matthew Steven
core +1 more source
Depth, Highness and DNR degrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We study Bennett deep sequences in the context of recursion theory; in particular we investigate the notions of O(1)-deepK, O(1)-deepC , order-deep K and order-deep C sequences. Our main results are that Martin-Loef random sets are not order-deepC , that
Philippe Moser, Frank Stephan
doaj +1 more source
The Computational Complexity of Duality
, 2016 We show that for any given norm ball or proper cone, weak membership in its dual ball or dual cone is polynomial-time reducible to weak membership in the given ball or cone.
Friedland, Shmuel, Lim, Lek-Heng
core +1 more source
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source