Results 91 to 100 of about 1,003,788 (328)

Lower Bounds for the Graph Homomorphism Problem

open access: yes, 2015
The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$.
A Björklund   +19 more
core   +1 more source

An upstream open reading frame regulates expression of the mitochondrial protein Slm35 and mitophagy flux

open access: yesFEBS Letters, EarlyView.
This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva   +5 more
wiley   +1 more source

Nonuniform ACC Circuit Lower Bounds [PDF]

open access: yesJournal of the ACM, 2011
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD m gates, where m > 1 is an arbitrary constant. We prove the following. ---NEXP, the class of languages accepted in nondeterministic exponential time, does not ...
openaire   +2 more sources

Hardness measures and resolution lower bounds [PDF]

open access: yes, 2014
Various "hardness" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving.
Beyersdorff, Olaf, Kullmann, Oliver
core  

In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS

open access: yesFEBS Letters, EarlyView.
We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka   +11 more
wiley   +1 more source

Sequence determinants of RNA G‐quadruplex unfolding by Arg‐rich regions

open access: yesFEBS Letters, EarlyView.
We show that Arg‐rich peptides selectively unfold RNA G‐quadruplexes, but not RNA stem‐loops or DNA/RNA duplexes. This length‐dependent activity is inhibited by acidic residues and is conserved among SR and SR‐related proteins (SRSF1, SRSF3, SRSF9, U1‐70K, and U2AF1).
Naiduwadura Ivon Upekala De Silva   +10 more
wiley   +1 more source

Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2016
The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research.
A. Baliuk, A.S. Zinchenko
doaj  

Some characterizations of error bound for non-lower semicontinuous functions

open access: yesJournal of Inequalities and Applications, 2019
In this paper, we study the error bound of non-lower semicontinuous functions. First, we extend the concepts of strong slope and global slope to the non-lower semicontinuous functions.
Miantao Chao   +2 more
doaj   +1 more source

Structural instability impairs function of the UDP‐xylose synthase 1 Ile181Asn variant associated with short‐stature genetic syndrome in humans

open access: yesFEBS Letters, EarlyView.
The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li   +2 more
wiley   +1 more source

Lower bound for dilatations

open access: yesJournal of Topology, 2018
We prove a new lower bound for the dilatation of an arbitrary pseudo-Anosov map on a surface of genus g with n punctures. Our bound improves the former super-exponential dependence on the genus by a polynomial dependence.
openaire   +5 more sources

Home - About - Disclaimer - Privacy