Results 71 to 80 of about 679,842 (277)
Information-theoretic lower bounds for quantum sorting
We analyze the quantum query complexity of sorting under partial information. In this problem, we are given a partially ordered set $P$ and are asked to identify a linear extension of $P$ using pairwise comparisons.
Cardinal, Jean +2 more
core
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
Cell wall target fragment discovery using a low‐cost, minimal fragment library
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Counterexamples to the Neggers-Stanley conjecture
The Neggers-Stanley conjecture (also known as the Poset conjecture) asserts that the polynomial counting the linear extensions of a partially ordered set on $\{1,2,...,p\}$ by their number of descents has real zeros only.
Brändén, Petter
core +1 more source
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
In this research work, the necessary and sufficient conditions of a coupled coincidence point of certain type of generalized contractions are explored. These results are considered under JS-metric spaces equipped with a partial order.
A. H. Ansari +3 more
doaj +1 more source
Shaprly transitive partially ordered sets
If \(\Lambda\) is a p.o. set, \(A=Aut(\Lambda,\leq)\) will denote its group of automorphisms. If for each \(\lambda_ 1,\lambda_ 2\in \Lambda\) there is a unique \(a\in A\) such that \(\lambda_ 1a=\lambda_ 2\), we say that \(\Lambda\) is sharply transitive. It is easily seen that any sharply transitive p.o. set is connected or has just 2 elements.
openaire +1 more source
Asymptotic enumeration of partially ordered sets [PDF]
The author define the entropy function S( ρ)=Lim n- ∞ 2n −2 lnN (n, ρ ), where N(n, ρ ) is the number of distinct partial order relations which may be defined on a set of n elements such that a fraction ρ of the possible n(n−1)/2 pairs are comparable.We derive upper bounds to S(ρ) to show that S(ρ) .699.
openaire +3 more sources
Structural biology of ferritin nanocages
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley +1 more source
An extended inequality approach for evaluating decision making units with a single output
In this work, an extended evaluation approach for decision making units (DMUs) with a single output is proposed. Firstly, the input and output data for each DMU are changed in the same proportion until all the outputs are equal, and then the coordinate ...
Xiao-Li Meng, Fu-Gui Shi
doaj +1 more source

