Results 151 to 160 of about 504,784 (313)
Allocating costs in set covering problems [PDF]
, 2019 This paper deals with the problem of allocating costs in set covering situations. In particular, we focus on set covering situations where the optimal covering is given in advance. Thus, we take into account only the facilities that have to be opened and
Sánchez-Soriano, Joaquin +4 more
core
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
FEBS Open Bio, EarlyView.We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source
Set Covering and Involutory Bases
Some new properties associated with the special class of integer programs known as weighted set covering problems are derived. While it is well known that an optimal integer solution to the set covering problem is a basic feasible solution to the ...
Mandell Bellmore, H. Donald Ratliff
core +1 more source
Approximation of the Quadratic Set Covering problem
, 2007 We study in this article the polynomial approximation properties of the Quadratic Set Covering problem. This problem, which arises in many applications, is a natural generalization of the usual Set Covering problem. We show that this problem is very hard
Escoffier, Bruno +2 more
core +1 more source
FEBS Open Bio, EarlyView.Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane +11 more
wiley +1 more source
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand,
Fischer, Felix, Brandt, Felix
core
FEBS Open Bio, EarlyView.Bioscience students were asked for their opinions on the value and teaching of skills. 204 responded that teamwork, time management and study skills are necessary to reach University, that scientific writing, research, laboratory and presentation skills are taught effectively during their studies, while other skills are gained inherently through study ...
Janella Borrell, Susan Crennell
wiley +1 more source
The non-covered set in Dvoretzky covering is a set of multiplicity
We prove that the non-covered set in Dvortezky random covering is a set of multiplicity, by showing that the natural multiplicative chaotic measure is a Rajchman measure.
openaire +2 more sources
FEBS Open Bio, EarlyView.The MRP4 transporter exports several drugs and signaling molecules. Here, we identified key promoter elements regulating basal MRP4 expression. Using reporter assays, we defined a conserved region with essential Sp1 and contributory Ets sites, which controlled basal MRP4 expression.
Debora Singer +7 more
wiley +1 more source
Application of the artificial bee colony algorithm for solving the set covering problem. [PDF]
ScientificWorldJournal, 2014 Crawford B, Soto R, Cuesta R, Paredes F.
europepmc +1 more source