R. Andonov, N. Yanev, and N. Malod-dognin, An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem, WABI '08: Proceedings of the 8th international workshop on Algorithms in Bioinformatics, pp.162-173, 2008.
DOI : 10.1007/978-3-540-87361-7_14

URL : https://hal.archives-ouvertes.fr/inria-00327135

A. Andreeva, D. Howorth, J. Chandonia, S. E. Brenner, T. J. Hubbard et al., Data growth and its impact on the SCOP database: new developments, Nucleic Acids Research, vol.36, issue.Database, pp.419-425, 2007.
DOI : 10.1093/nar/gkm993

I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The maximum clique problem. Handbook of Combinatorial Optimization, 1999.
DOI : 10.1007/978-1-4757-3023-4_1

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-577, 1973.
DOI : 10.1145/362342.362367

M. L. Fredman, On computing the length of longest increasing subsequences, Discrete Mathematics, vol.11, issue.1, pp.29-35, 1975.
DOI : 10.1016/0012-365X(75)90103-X

J. Gibrat, T. Madej, and S. H. Bryant, Surprising similarities in structure comparison, Current Opinion in Structural Biology, vol.6, issue.3, pp.377-385, 1996.
DOI : 10.1016/S0959-440X(96)80058-3

A. Godzik and J. Skolnick, Flexible algorithm for direct multiple alignment of protein structures and sequences, Bioinformatics, vol.10, issue.6, pp.587-596, 1994.
DOI : 10.1093/bioinformatics/10.6.587

A. Godzik, The structural alignment between two proteins: Is there a unique answer?, Protein Science, vol.221, issue.7, pp.1325-1338, 1996.
DOI : 10.1002/pro.5560050711

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, vol.6, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

J. Konc and D. Janezic, An efficient branch-and-bound algorithm for finding a maximum clique, Discrete Mathematics and Theoretical Computer Science, vol.58, p.220, 2003.

G. Lancia, R. Carr, B. Walenz, and S. Istrail, 101 optimal PDB structure alignments, Proceedings of the fifth annual international conference on Computational biology , RECOMB '01, pp.193-202, 2001.
DOI : 10.1145/369133.369199

. Gibrat, Protein secondary structure assignment revisited: a detailed analysis of different assignment methods, BMC Structural Biology, vol.5, p.17, 2005.
URL : https://hal.archives-ouvertes.fr/inserm-00090199

R. J. Patric and . Ostergård, A fast algorithm for the maximum clique problem

M. L. Sierk and G. J. Kleywegt, D??j?? Vu All Over Again, Structure, vol.12, issue.12, pp.2103-2111, 2004.
DOI : 10.1016/j.str.2004.09.016

D. M. Strickland, E. Barnes, and J. S. Sokol, Optimal Protein Structure Alignment Using Maximum Cliques, Operations Research, vol.53, issue.3, pp.389-402, 2005.
DOI : 10.1287/opre.1040.0189

E. Tomita and T. Seki, An improved branch and bound algorithm for the maximum clique problem, Communications in Mathematical and in Computer Chemistry / MATCH, vol.58, pp.569-590, 2007.