Iterated local search with partition crossover for computational protein design - Archive ouverte HAL Access content directly
Journal Articles Proteins - Structure, Function and Bioinformatics Year : 2021

Iterated local search with partition crossover for computational protein design

Abstract

Structure-based computational protein design (CPD) refers to the problem of finding a sequence of amino acids which folds into a specific desired protein structure, and possibly fulfills some targeted biochemical properties. Recent studies point out the particularly rugged CPD energy landscape, suggesting that local search optimization methods should be designed and tuned to easily escape local minima attraction basins. In this article, we analyze the performance and search dynamics of an iterated local search (ILS) algorithm enhanced with partition crossover. Our algorithm, PILS, quickly finds local minima and escapes their basins of attraction by solution perturbation. Additionally, the partition crossover operator exploits the structure of the residue interaction graph in order to efficiently mix solutions and find new unexplored basins. Our results on a benchmark of 30 proteins of various topology and size show that PILS consistently finds lower energy solutions compared to Rosetta fixbb and a classic ILS, and that the corresponding sequences are mostly closer to the native.
Fichier principal
Vignette du fichier
PILS__proteins_journal.pdf (268.3 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03298736 , version 1 (23-07-2021)

Licence

Identifiers

Cite

François Beuvin, Simon De Givry, Thomas Schiex, Sébastien Verel, David Simoncini. Iterated local search with partition crossover for computational protein design. Proteins - Structure, Function and Bioinformatics, 2021, 89 (11), pp.1522-1529. ⟨10.1002/prot.26174⟩. ⟨hal-03298736⟩
125 View
140 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More