Comparaison de structures protéïques : Résolution de la maximisation du recouvrement de cartes de contacts par solveur LMC
Résumé
The study of proteins structures similarities has been the subject of numerous works over the past decades. It is admitted that proteins sharing strong similarities will have similar functions. Nowadays, the goal of this study is to find a way to automate the comparison and the classification of proteins. In order to reach this goal, many methods have been set up over the years. Among them, we are especially interested in the Contact Map Overlap maximization, which transforms the comparison of proteins structures similarities into the search of a maximum clique (LMC) research in a graph. In this paper we will detail the steps of this transformation, from the modelling of proteins to the resolution of the problem by our maximum clique finder algorithm LMC. This algorithm Stagiaire Master I is able to treat very large graphs, essential to deal with the benchmarks related to this problem.