Modèle de PLNE pour la recherche de cliques de poids maximal

National audienceEstimating the similarity of two protein structures is a very important task in biology. It is usually based on an alignment, i.e. a one to one matching between the amino-acids of each protein. Between all the methods for aligning proteins we are interested in VAST, which first aligns the secondary structures (SSE) and then extends this alignment to the amino-acids. The SSEs alignment is presented as a maximum clique problem in a particular graph. In this paper we propose a new integer programming model for various maximum weight clique problems and we successfully applied it in VAST