Results 41 to 50 of about 1,427,211 (329)
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
FEBS Letters, EarlyView.In this study, we present the structure of AcrIE8.1, a previously uncharacterized anti‐CRISPR protein that inhibits the type I‐E CRISPR‐Cas system. Through a combination of structural and biochemical analyses, we demonstrate that AcrIE8.1 directly binds to the Cas11 subunit of the Cascade complex to inhibit the CRISPR‐Cas system.
Young Woo Kang, Hyun Ho Park
wiley +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
Computational Complexity for Physicists [PDF]
, 2002 These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.Comment: references updated, reprint available from http://itp.nat.uni-magdeburg.de/~mertens/papers ...
Mertens, Stephan
core +2 more sources
Molecular bases of circadian magnesium rhythms across eukaryotes
FEBS Letters, EarlyView.Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley +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
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source
Data Integration Challenges for Machine Learning in Precision Medicine
Frontiers in Medicine, 2022 A main goal of Precision Medicine is that of incorporating and integrating the vast corpora on different databases about the molecular and environmental origins of disease, into analytic frameworks, allowing the development of individualized, context ...
Mireya Martínez-García +2 more
doaj +1 more source
Mechanisms of parasite‐mediated disruption of brain vessels
FEBS Letters, EarlyView.Parasites can affect the blood vessels of the brain, often causing serious neurological problems. This review explains how different parasites interact with and disrupt these vessels, what this means for brain health, and why these processes matter. Understanding these mechanisms may help us develop better ways to prevent or treat brain infections in ...
Leonor Loira +3 more
wiley +1 more source
Fourier spectra of measures associated with algorithmically random Brownian motion [PDF]
Logical Methods in Computer Science, 2014 In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion.
Willem Louw Fouché +2 more
doaj +1 more source