Results 51 to 60 of about 23,348,161 (293)

Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time

Algorithms
Consider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach upon one another at a fixed time if their separation is less than some specified threshold ...
William Evans, David Kirkpatrick
doaj   +1 more source

Structural and biochemical analysis of a B12 superbinder

FEBS Letters, EarlyView.
BtuG proteins are vitamin B12 scavengers in Bacteroides thetaiotaomicron, a dominant human gut bacterium. We present crystal structures of three BtuG homologs bound to cobalamin and its precursor cobinamide, revealing picomolar binding affinities, among the highest known for any natural protein.
Jose M. Martinez Felices, Jacob J. Whittaker, Dirk J. Slotboom, Albert Guskov   +3 more
wiley   +1 more source

Online Algorithmic Study of Facility Location Problems: A Survey

IEEE Access
Facility Location problems are one of the most prominent optimization problems in computer science, operations research, and combinatorial optimization. Their simple yet intrinsic structure has led to their widespread application in diverse fields, such ...
Christine Markarian
doaj   +1 more source

The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation

FEBS Letters, EarlyView.
Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge, Vivian Pogenberg, Alexander Baumgart, Bente Siebels, Hartmut Schlüter, Michael Hecht‐Bucher, Aymelt Itzen   +6 more
wiley   +1 more source

Competitive Analysis of Algorithms for an Online Distribution Problem

Algorithms
We study an online distribution problem in which a producer has to send a load from an origin to a destination. At each time period before the deadline, they ask for transportation price quotes and have to decide to either accept or not accept the ...
Alessandro Barba, Luca Bertazzi, Bruce L. Golden   +2 more
doaj   +1 more source

The ubiquitin system in normal and infected germinal center B cells

FEBS Letters, EarlyView.
The ubiquitin system plays a central role in germinal center (GC) B cells, influencing differentiation to long‐lived memory B cells. Oncogenic gammaherpesviruses gain access to memory B cells by establishing latency in GC B cells. Mapping ubiquitin mechanisms in normal and infected GC B cells will define specific molecular circuits in B cells germane ...
Destiny Davis, Lesly Mejia, Emily K Moser   +2 more
wiley   +1 more source

Real Power Loss Reduction by Enhanced Imperialist Competitive Algorithm [PDF]

, 2017
In this paper, an Enhanced Imperialist Competitive (EIC) Algorithm is proposed for solving reactive power problem. Imperialist Competitive Algorithm (ICA) which was recently introduced has shown its decent performance in optimization problems.
Kanagasabai, Lenin
core   +1 more source

Metastatic niche shaped by host factors influences disseminated cancer cell fate

FEBS Letters, EarlyView.
Metastasis is shaped not only by cancer cells but also by the environments they encounter. This review explores how factors such as aging, diet, the microbiome, lifestyle, and environmental exposures remodel organ‐specific niches in the lung, liver, bone, and brain, influencing where metastatic cells survive, remain dormant, or grow, and ultimately ...
Gwennan Delyth Ward, Álvaro Ruiz‐Tabas, Patricia Altea‐Manzano   +2 more
wiley   +1 more source

Membrane composition and thermodynamic identity as boundaries of life for synthetic cell research

FEBS Letters, EarlyView.
What makes a cell a cell? The boundary of a living cell is not just a wall. Read as a Markov blanket, the membrane separates internal from external states, generating identity and non‐equilibrium order. Can this identity be rebuilt from scratch in a synthetic cell?
Caterina Presutti, Bert Poolman
wiley   +1 more source

Competitive analysis of flash memory algorithms [PDF]

ACM Transactions on Algorithms, 2006
Flash memories are widely used in computer systems ranging from embedded systems to workstations and servers to digital cameras and mobile phones. The memory cells of flash devices can only endure a limited number of write cycles, usually between 10,000 and 1,000,000. Furthermore, cells containing data must be erased
Avraham Ben-Aroya, Sivan Toledo
openaire   +2 more sources