Results 51 to 60 of about 449,948 (311)
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
08381 Abstracts Collection – Computational Complexity of Discrete Problems [PDF]
, 2008 From the 14th of September to the 19th of September, the Dagstuhl Seminar 08381 ``Computational Complexity of Discrete Problems'' was held in Schloss Dagstuhl - Leibniz Center for Informatics.
van Melkebeek, Dieter +3 more
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
Complexity in Scalable Computing [PDF]
Scientific Programming, 2008 The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity.
openaire +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +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.
Scott Aaronson, Aaronson, Scott
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
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
FEBS Letters, EarlyView.Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source
09421 Abstracts Collection – Algebraic Methods in Computational Complexity [PDF]
, 2010 From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 ``Algebraic Methods in Computational Complexity '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Agrawal, Manindra +3 more
core +1 more source
Lower Bound on Weights of Large Degree Threshold Functions [PDF]
Logical Methods in Computer Science, 2013 An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$.
Vladimir V. Podolskii
doaj +1 more source