Maximum Cliques in Protein Structure Comparison - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Maximum Cliques in Protein Structure Comparison


Computing the similarity between two protein structures is a crucial task in molecular biology, and has been extensively investigated. Many protein structure comparison methods can be modeled as maximum clique problems in specific k-partite graphs, referred here as alignment graphs. In this paper, we propose a new protein structure comparison method based on internal distances (DAST), which main characteristic is that it generates alignments having RMSD smaller than any previously given threshold. DAST is posed as a maximum clique problem in an alignment graph, and in order to compute DAST's alignments, we also design an algorithm (ACF) for solving such maximum clique problems. We compare ACF with one of the fastest clique finder, recently conceived by Österg˙ard. On a popular benchmark (the Skolnick set) we observe that ACF is about 20 times faster in average than the Österg˙ard's algorithm. We then successfully use DAST's alignments to obtain automatic classification in very good agreement with SCOP.
Fichier principal
Vignette du fichier
Cliques_2010.pdf (194.5 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00536700 , version 1 (23-11-2010)



Noël Malod-Dognin, Rumen Andonov, Nicola Yanev. Maximum Cliques in Protein Structure Comparison. SEA 2010 9th International Symposium on Experimental Algorithms, May 2010, Naples, Italy. pp.106-117, ⟨10.1007/978-3-642-13193-6_10⟩. ⟨inria-00536700⟩
233 View
207 Download



Gmail Facebook X LinkedIn More