Local Search Heuristic for Rigid Protein Docking
نویسندگان
چکیده
We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and improves by applying a rigid motion to one of the two proteins. Our implementation of the algorithm takes between three and ten seconds and converges with high likelihood to the correct docked configuration, provided it starts at a position away from the correct one by at most 18 degrees of rotation and at most ̊ of translation. The speed and convergence radius make this an attractive algorithm to use in combination with a coarse sampling of the six-dimensional space of rigid motions.
منابع مشابه
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking
The protein docking problem is to predict the structure of protein-protein complexes from the structures of individual proteins. It is believed that shape complementarity plays a dominant role in protein docking. Recently, it has been shown empirically by Bespamaytnikh et al [4] that the shape complementarity (measured by a score function) is sufficient for the bound protein docking problem, in...
متن کاملY : An Efficient Algorithm for Small - Molecule Docking
In this paper, we present a new algorithm, which is based on an efficient heuristic for local search, for rigid protein ± small-molecule docking.We tested our algorithm, called , on the recent 100-complex benchmark , using the conformer generator OMEGA [15] to generate a set of low-energy conformers. The results showed that is competitive both in terms of algorithm efficiency and docking accuracy.
متن کاملFlexible protein-protein docking based on Best-First search algorithm
We developed a new high resolution protein-protein docking method based on Best-First search algorithm that loosely imitates protein-protein associations. The method operates in two stages: first, we perform a rigid search on the unbound proteins. Second, we search alternately on rigid and flexible degrees of freedom starting from multiple configurations from the rigid search. Both stages use h...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملScheduling of trucks in cross-docking systems: a hybrid meta-heuristic algorithm
Cross-docking is a logistics technique that minimizes the storage and order picking functions of a warehouse while still allowing it to serve its receiving and shipping functions. In this paper, we propose a novel hybrid meta-heuristic algorithm for solving scheduling trucks in cross-docking problems. This algorithm comprises three components: an initial population generation method based on an...
متن کامل