1,060 research outputs found

    Thermodynamic Prediction of Protein Neutrality

    Get PDF
    We present a simple theory that uses thermodynamic parameters to predict the probability that a protein retains the wildtype structure after one or more random amino acid substitutions. Our theory predicts that for large numbers of substitutions the probability that a protein retains its structure will decline exponentially with the number of substitutions, with the severity of this decline determined by properties of the structure. Our theory also predicts that a protein can gain extra robustness to the first few substitutions by increasing its thermodynamic stability. We validate our theory with simulations on lattice protein models and by showing that it quantitatively predicts previously published experimental measurements on subtilisin and our own measurements on variants of TEM1 beta-lactamase. Our work unifies observations about the clustering of functional proteins in sequence space, and provides a basis for interpreting the response of proteins to substitutions in protein engineering applications

    Using POPMUSIC for Candidate Set Generation in the Lin-Kernighan-Helsgaun TSP Solver

    Get PDF

    POPMUSIC for the Travelling Salesman Problem

    Get PDF
    POPMUSIC— Partial OPtimization Metaheuristic Under Special Intensification Conditions — is a template for tackling large problem instances. This metaheuristic has been shown to be very efficient for various hard combinatorial problems such as p-median, sum of squares clustering, vehicle routing, map labelling and location routing. A key point for treating large Travelling Salesman Problem (TSP) instances is to consider only a subset of edges connecting the cities. The main goal of this article is to present how to build a list of good candidate edges with a complexity lower than quadratic in the context of TSP instances given by a general function. The candidate edges are found with a technique exploiting tour merging and the POPMUSIC metaheuristic. When these candidate edges are provided to a good local search engine, high quality solutions can be found quite efficiently. The method is tested on TSP instances of up to several million cities with different structures (Euclidean uniform, clustered, 2D to 5D, grids, toroidal distances). Numerical results show that solutions of excellent quality can be obtained with an empirical complexity lower than quadratic without exploiting the geometrical properties of the instances

    Optimization of Green Pickup and Delivery Operations in Multi-depot Distribution Problems

    Get PDF
    In this work, the Multi-Depot Green VRP with Pickups and Deliveries (MDGVRP-PD) is studied. It is a routing optimization problem in which the objective is to construct a set of vehicle routes considering multiple depots and one-to-one pickup and delivery operations that minimize emissions through fuel consumption, which depends on weight and travel distance. In one-to-one problems, goods must be transported between a single origin and its single associated destination. Practical considerations imply addressing the pickup and delivery of customers from multiple depots, where a logistics service company can efficiently combine its resources, thus reducing environmental pollution. To tackle this problem, we develop a mathematical programming formulation and matheuristic approach based on the POPMUSIC (Partial Optimization Metaheuristic under Special Intensification Conditions) framework. The results show that if the weight carried on the routes as part of the fitness measure is considered, our matheuristic approach provide an average percentage improvement in emissions of 30.79 %, compared to a fitness measure that only takes into account the distances of the routes.</p

    Protein stability: a single recorded mutation aids in predicting the effects of other mutations in the same amino acid site

    Get PDF
    Motivation: Accurate prediction of protein stability is important for understanding the molecular underpinnings of diseases and for the design of new proteins. We introduce a novel approach for the prediction of changes in protein stability that arise from a single-site amino acid substitution; the approach uses available data on mutations occurring in the same position and in other positions. Our algorithm, named Pro-Maya (Protein Mutant stAbilitY Analyzer), combines a collaborative filtering baseline model, Random Forests regression and a diverse set of features. Pro-Maya predicts the stability free energy difference of mutant versus wild type, denoted as ΔΔG
    corecore