Results 81 to 90 of about 1,967,671 (302)
Reconstructing enzyme evolution by protein engineering
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
This volume contains the 33 papers presented at IPCO 2011, the 15th Conference on Integer Programming and Combinatorial Optimization, held during June 15–17, 2011 at the IBM T.J. Watson Research Center in New York, USA.
Woeginger, G.J., Günlük, O.
core +1 more source
Investigating transcription factor dynamics in health and disease using FRAP
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source
kyspencer/Survey-on-Nuclear-Combinatorial-Optimization-Studies: v1.0
<p>This survey was conducted to determine which optimization algorithms nuclear engineers have used to solve combinatorial problems.</p ...
Kristy Yancey Spencer
core +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
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
Combinatorial optimization tolerances calculated in linear time [PDF]
For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and ...
Goldengorin, Boris, Sierksma, Gerard
core
Algorithmic aspects of combinatorial discrepancy
This chapter describes some recent results in combinatorial discrepancy theory motivated by designing efficient polynomial time algorithms for finding low discrepancy colorings. Until recently, the best known results for several combinatorial discrepancy
Srivastav, A. +3 more
core +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
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
Emerging experimental and computational methods for studying redox‐regulated structural transitions
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
Combinatorial optimization algorithms on quantum and quantum inspired devices
Safro, IlyaFrom "quantum-inspired" complementary metal–oxide–semiconductor annealers to universal quantum computers, recent advances in these emerging technologies open the floor for discussions about finding practical applications as well as the ...
Liu, Xiaoyuan
core +1 more source

