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

Abstract : Estimating 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.
Complete list of metadatas

https://hal.inria.fr/inria-00327118
Contributor : Noel Malod-Dognin <>
Submitted on : Tuesday, October 7, 2008 - 1:59:27 PM
Last modification on : Thursday, April 4, 2019 - 11:48:11 AM
Long-term archiving on : Friday, June 4, 2010 - 12:18:17 PM

File

roadef08.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00327118, version 1

Citation

Noël Malod-Dognin, Rumen Andonov, Nicola Yanev, Jean-François Gibrat. Modèle de PLNE pour la recherche de cliques de poids maximal. ROADEF 2008, Institut Supérieur d'Informatique, de Modélisation et de leurs Applications, Feb 2008, Clermont-Ferrand, France. ⟨inria-00327118⟩

Share

Metrics

Record views

281

Files downloads

142