Results 111 to 120 of about 10,268,798 (293)
FEBS Letters, EarlyView.Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm [PDF]
QuantumWe consider the maximum cut and maximum independent set problems on random regular graphs in the infinite-size limit, and calculate the energy densities achieved by QAOA for high degrees up to $d=100$.
Elisabeth Wybo, Martin Leib
doaj +1 more source
Algorithms for Maximum Independent Set Applied to Map Labelling [PDF]
, 2000 We consider the following map labelling problem: given distinct points p 1, p 2,..., p n in the plane, and given σ, find a maximum cardinality set of pairwise disjoint axis-parallel σ× σ squares Q1, Q2,..., Qr.
Aardal, K.I. +7 more
core
Robust maximum weighted independent-set problems on interval graphs
, 2014 We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertexweights.We use the absolute robustness criterion and the min–max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core +1 more source
FEBS Letters, EarlyView.Mycobacterial 3‐methylcrotonyl‐CoA carboxylase uses a mobile biotin‐carrying domain to shuttle a carboxyl group between two catalytic sites, enabling carboxylation of 3‐methylcrotonyl‐CoA during leucine breakdown. Cryo‐electron microscopy captures the carrier at both sites and reveals an inward loop movement that may prevent futile rebinding to the ...
Ajit Yadav +2 more
wiley +1 more source
Shor’s bounds for the weighted independence number
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2019 Application of a technique of dual Lagrangian quadratic bounds of N.Z. Shor to studying the Maximum Weighted Independent Set problem is described. By the technique, two such N.Z. Shor’s upper bounds are obtained.
П. І. Стецюк +1 more
doaj +1 more source
Maximum genus and maximum nonseparating independent set of a 3-regular graph [PDF]
, 1997 A set J ⊆ V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E ∩ {uv | ∀u, v ∈ J} = 0, and G − J is connected. We call z(G) = maxJ{|J||J is an nsis of G} the nsis number of G.
Huang, Yuangqiu, Liu, Yanpei
core +1 more source
FEBS Letters, EarlyView.Synechocystis strains deficient in succinate dehydrogenase (SDH) secrete more succinate than the WT under dark anaerobic conditions, supporting that SDH then primarily acts as SDH, not as a fumarate reductase. L‐aspartate oxidase (Laspo) from Synechocystis is functional under anaerobic conditions, reducing fumarate to succinate.
Kateryna Kukil +3 more
wiley +1 more source
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
, 2008 Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that
Morgado, Antonio Jose +1 more
core +2 more sources
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
Discussiones Mathematicae Graph Theory, 2015 The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We
Paj Tjaša, Špacapan Simon
doaj +1 more source