Skip to Main content Skip to Navigation
Journal articles

A new framework for computational protein design through cost function network optimization

Abstract : Motivation: The main challenge for structure-based computational protein design (CPD) remains the combinatorial nature of the search space. Even in its simplest fixed-backbone formulation, CPD encompasses a computationally difficult NP-hard problem that prevents the exact exploration of complex systems defining large sequence-conformation spaces.[br/] Results: We present here a CPD framework, based on cost function network (CFN) solving, a recent exact combinatorial optimization technique, to efficiently handle highly complex combinatorial spaces encountered in various protein design problems. We show that the CFN-based approach is able to solve optimality a variety of complex designs that could often not be solved using a usual CPD-dedicated tool or state-of-the-art exact operations research tools. Beyond the identification of the optimal solution, the global minimum-energy conformation, the CFN-based method is also able to quickly enumerate large ensembles of suboptimal solutions of interest to rationally build experimental enzyme mutant libraries.
Document type :
Journal articles
Complete list of metadata

Cited literature [53 references]  Display  Hide  Download
Contributor : Archive Ouverte Prodinra Connect in order to contact the contributor
Submitted on : Tuesday, May 21, 2019 - 6:04:37 PM
Last modification on : Tuesday, October 19, 2021 - 11:17:40 PM


Publisher files allowed on an open archive




Seydou Traore, David Allouche, Isabelle André, Simon de Givry, George Katsirelos, et al.. A new framework for computational protein design through cost function network optimization. Bioinformatics, Oxford University Press (OUP), 2013, 29 (17), pp.2129-2136. ⟨10.1093/bioinformatics/btt374⟩. ⟨hal-01268153⟩



Les métriques sont temporairement indisponibles