Results 61 to 70 of about 6,941,251 (285)
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies [PDF]
, 2012 This paper proposes the use of multiagent cooperation for solving global optimization problems through the introduction of a new multiagent environment, MANGO.
Günay, Akın +6 more
core +1 more source
Globally optimal regions and boundaries [PDF]
Proceedings of the Seventh IEEE International Conference on Computer Vision, 1999 We propose a new form of energy functional for the segmentation of regions in images, and an efficient method for finding its global optima. The energy can have contributions from both the region and its boundary, thus combining the best features of region- and boundary-based approaches to segmentation. By transforming the region energy into a boundary
Ian Jermyn, Hiroshi Ishikawa 0002
openaire +4 more sources
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
IEEE AccessThe Tasmanian Devil Optimization (TDO) algorithm, a recently popular metaheuristic algorithm, exhibits issues such as slow convergence, low precision, and susceptibility to getting stuck in local optima when applied to practical problems.
Wei Wang, Lixin Lyu
doaj +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
An improved chaotic firefly algorithm for global numerical optimization
International Journal of Computational Intelligence Systems, 2018 Firefly algorithm (FA) is a prominent metaheuristc technique. It has been widely studied and hence there are a lot of modified FA variants proposed to solve hard optimization problems from various areas.
Ivona Brajević, Predrag Stanimirović
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
Fast Task Scheduling With Model Predictive Control Integrating a Priority-Based Heuristic
IEEE AccessThis paper presents a scalable Model Predictive Control (MPC) algorithm for task scheduling and real time re-scheduling. The use case motivating the work is given by the problem of managing the integration activities involved in the final assembly of the
Francesco Liberati +3 more
doaj +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