Results 61 to 70 of about 96,047 (264)
Lower bounds for local approximation [PDF]
Journal of the ACM, 2012 In the study of deterministic distributed algorithms, it is commonly assumed that each node has a unique O (log n )-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and ...
Mika Göös +2 more
openaire +2 more sources
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
New lower bounds for van der Waerden numbers
Forum of Mathematics, Pi, 2022 We show that there is a red-blue colouring of $[N]$ with no blue 3-term arithmetic progression and no red arithmetic progression of length $e^{C(\log N)^{3/4}(\log \log N)^{1/4}}$.
Ben Green
doaj +1 more source
Lower bounds by Birkhoff interpolation
Journal of Complexity, 2017 In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor.
Garcia-Marco, Ignacio, Koiran, Pascal
openaire +3 more sources
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
Lower bounds for the expected sample size in the classical and d-posterior statistical problems
Учёные записки Казанского университета: Серия Физико-математические науки, 2018 In this report, the problem of construction of lower boundaries for the expected sample size of statistical inference procedures has been considered. The general methodology for construction of the lower bounds and the review of the main results for the ...
I.A. Kareev, I.N. Volodin
doaj
A Time Lower Bound for Satisfiability
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter van Melkebeek, Ran Raz
openaire +1 more source
A Lower Bound for Jumbled Indexing [PDF]
, 2020 In this paper we study lower bounds for a variant of jumbled-indexing problem: given an input string S on an alphabet Σ = {σ1, . . ., σλ}, store it in a data structure such that given frequencies f1, · · ·, fλ, one can find all the substrings S0 of S where the frequency of the character σi is fi, for 1 ≤ i ≤ λ.
Afshani, Peyman +3 more
openaire +2 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source