Results 61 to 70 of about 211,682 (273)

Combinatorial Optimization by Iterative Partial Transcription

, 1999
A procedure is presented which considerably improves the performance of local search based heuristic algorithms for combinatorial optimization problems.
A. Möbius, B. Freisleben, D- Dresden, P. Merz, Typeset Using Revtex   +4 more
core   +2 more sources

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

FEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe, Tanmay Kumar Mohanty, Rashna Bhandari, Dorothea Fiedler   +3 more
wiley   +1 more source

A Computational Study of Genetic Crossover Operators for Multi-Objective Vehicle Routing Problem with Soft Time Windows [PDF]

, 2008
The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows.
Geiger, Martin Josef
core   +1 more source

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

FEBS 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, Yuxi Liu, Stefano Maggi, Debnath Ghosal, Jue Wang, Prashant P. Damke, Stephen D. Carter, Wei Zhao, Sukhithasri Vijayrajratnam, Joseph P. Vogel, Carrie L. Shaffer, Grant J. Jensen   +11 more
wiley   +1 more source

Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search [PDF]

Jisuanji kexue yu tansuo
In order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, and uniformity has gradually become one of the important goals in multi-objective optimization ...
WEI Qian, JI Bin
doaj   +1 more source

Systems approaches and algorithms for discovery of combinatorial therapies

, 2009
Effective therapy of complex diseases requires control of highly non-linear complex networks that remain incompletely characterized. In particular, drug intervention can be seen as control of signaling in cellular networks.
Agoston V, Balamurugan D, Calzolari D, Carlson JM, Greco WR, Johannesson GH, Nelander S, Segota E, Spall JC, Wadman M, Weinberg RA, Yang K   +11 more
core   +1 more source

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

FEBS 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, Pedro A. Sánchez‐Murcia, Bernd Nidetzky   +2 more
wiley   +1 more source

State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems

IEEE Access, 2019
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han, Yingchao Dong, Lin Yue, Quanxi Xu   +3 more
doaj   +1 more source

Discrete Convex Functions on Graphs and Their Algorithmic Applications

, 2017
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years.
A Bernáth, A Frank, AV Goldberg, AV Karzanov, AV Karzanov, AV Karzanov, AWJ Kolen, BC Tansel, E Anshelevich, F Kuivinen, G Grätzer, H Hirai, H Hirai, H Hirai, H Hirai, H-J Bandelt, J Kleinberg, K Murota, K Murota, K Murota, MA Babenko, MR Bridson, N Garg, P Abramenko, P Favati, R Hassin, S Fujishige, S Fujishige, S Fujishige, S Fujishige, S Fujishige, S Živný, T Fukunaga, V Chepoi, V Kolmogorov, VV Vazirani, Y Iwata   +36 more
core   +1 more source

Cell wall target fragment discovery using a low‐cost, minimal fragment library

FEBS Letters, EarlyView.
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, Mathew Stanley, Olawale Raimi, Andrew T. Ferenbach, Helge C Dorfmueller, Daan M. F. van Aalten   +5 more
wiley   +1 more source