@. N. Malod-dognin, R. Andonov, and N. Yanev, Solving Maximum Clique Problem for Protein Structure Similarity, Serdica Journal of Computing, vol.4, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00356816

@. N. Malod-dognin, R. Andonov, and N. Yanev, International conferences with selection and acts, Maximum Clique in Protein Structure Comparison " , SEA 2010, the ninth International Symposium on Experimental Algorithms, 2010.

@. R. Andonov, N. Yanev, and N. Malod-dognin, An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem International conferences with selection but without acts, WABI 2008, LNBI 5251, pp.162-173, 2008.

@. N. Malod-dognin, R. Andonov, and N. Yanev, Maximum clique approach to protein structure similarity, MASSEE (mathematical society of south-east europe ) International congress on mathematics, p.31, 2009.

@. N. Malod-dognin, R. Andonov, and N. Yanev, Maximum clique and similarity measures National conferences with selection and acts, MMSC'09 International Workshop on Mathematical modelling and scientific computations, p.22, 2009.

@. N. Malod-dognin, R. Andonov, N. Yanev, and J. Gibrat, Modèle de PLNE pour la recherche de cliques de poids maximal, pp.307-308, 2008.

@. R. Andonov, N. Yanev, and N. Malod-dognin, Maximum Contact Map Overlap Revisited, Journal of Computational Biology, vol.18, issue.1
DOI : 10.1089/cmb.2009.0196

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

J. Abello, P. M. Pardalos, and M. G. Resende, On maximum clique problems in very large graphs, External Memory Algorithms, pp.119-130, 1999.

F. Stephen, W. Altschul, W. Gish, E. W. Miller, D. J. Myers et al., Basic local alignment search tool, Journal of Molecular Biology, vol.215, issue.3, pp.403-410, 1990.

R. Andonov, S. Balev, and N. Yanev, Protein Threading: From Mathematical Models to Parallel Implementations, INFORMS Journal on Computing, vol.16, issue.4, pp.393-405, 2004.
DOI : 10.1287/ijoc.1040.0092

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

E. Balas, S. Ceria, G. Cornuejols, and G. Pataki, Polyhedral methods for the maximum clique problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, pp.11-28, 1996.

H. M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. N. Bhat et al., The Protein Data Bank, Nucleic Acids Research, vol.28, issue.1, pp.235-242, 2000.
DOI : 10.1093/nar/28.1.235

I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The maximum clique problem. Handbook of Combinatorial Optimization, 1999.

S. E. Brenner, C. Chothia, and T. J. Hubbard, Assessing sequence comparison methods with reliable structurally identified distant evolutionary relationships, Proceedings of the National Academy of Sciences, vol.95, issue.11, pp.6073-6078, 1998.
DOI : 10.1073/pnas.95.11.6073

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

S. Busygin, A new trust region technique for the maximum weight clique problem, Discrete Applied Mathematics, vol.154, issue.15, pp.2080-2096, 2006.
DOI : 10.1016/j.dam.2005.04.010

A. Caprara, R. Carr, S. Israil, G. Lancia, and B. Walenz, 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap, Journal of Computational Biology, vol.11, issue.1, pp.27-52, 2004.
DOI : 10.1089/106652704773416876

A. Caprara and G. Lancia, Structural alignment of large---size proteins via lagrangian relaxation, Proceedings of the sixth annual international conference on Computational biology , RECOMB '02, pp.100-108, 2002.
DOI : 10.1145/565196.565209

M. Carpentier, S. Brouillet, and J. Pothier, YAKUSA: A fast structural database scanning method, Proteins: Structure, Function, and Bioinformatics, vol.49, issue.Suppl 6, pp.137-151, 2005.
DOI : 10.1002/prot.20517

R. Carr, G. Lancia, and S. Istrail, Branch-and-cut algorithms for independent set problems: Integrality gap and an application to protein structure alignment, 2000.
DOI : 10.2172/764804

F. Cazals and C. Karande, A note on the problem of reporting maximal cliques, Theoretical Computer Science, vol.407, issue.1-3, pp.564-568, 2008.
DOI : 10.1016/j.tcs.2008.05.010

G. Collet, R. Andonov, N. Yanev, and J. Gibrat, Local protein threading by Mixed Integer Programming, Discrete Applied Mathematics, vol.159, issue.16, p.7122, 2009.
DOI : 10.1016/j.dam.2010.05.024

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

A. K. Dunker, J. D. Lawson, C. J. Brown, R. M. Williams, P. Romero et al., Intrinsically disordered protein, Journal of Molecular Graphics and Modelling, vol.19, issue.1, pp.26-59, 2001.
DOI : 10.1016/S1093-3263(00)00138-8

A. Falicov and F. E. Cohen, A Surface of Minimum Area Metric for the Structural Comparison of Proteins, Journal of Molecular Biology, vol.258, issue.5, pp.871-892, 1996.
DOI : 10.1006/jmbi.1996.0294

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

D. Frishman and P. Argos, Knowledge-based protein secondary structure assignment, Proteins: Structure, Function, and Genetics, vol.206, issue.4, pp.566-579, 1995.
DOI : 10.1002/prot.340230412

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

A. M. Geoffrion, Lagrangean relaxation for integer programming, Mathematical Programming Study, vol.2, pp.82-114, 1974.
DOI : 10.1007/BFb0120690

S. German and D. German, Stochastic relaxation, gibbs distributions, and the bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6, issue.6, pp.721-741, 1984.

M. Gerstein and M. Levitt, Using iterative dynamic programming to obtain accurate pair-wise and multiple alignments of protein structures, ISMB-96 Proceedings, pp.59-67, 1996.

M. Gerstein and M. Levitt, Comprehensive assessment of automatic structural alignment against a manual standard, the scop classification of proteins, Protein Science, vol.5, issue.2, pp.445-456, 1998.
DOI : 10.1002/pro.5560070226

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, 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

A. Godzik and J. Skolnick, Flexible algorithm for direct multiple alignment of protein structures and seequences, CABIOS, vol.10, pp.587-596, 1994.

D. Goldman, S. Israil, and C. Papadimitriu, Algorithmic aspects of protein structure similarity, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.512-521, 1999.
DOI : 10.1109/SFFCS.1999.814624

M. Guignard, Lagrangean relaxation, Top, vol.4, issue.2, pp.151-200, 2003.
DOI : 10.1007/BF02579036

A. Harrison, F. Pearl, I. Sillitoe, T. Slidel, R. Mott et al., Recognizing the fold of a protein structure, Bioinformatics, vol.19, issue.14, pp.141748-1759, 2003.
DOI : 10.1093/bioinformatics/btg240

M. Held and R. M. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees, Operations Research, vol.18, issue.6, pp.1138-1162, 1970.
DOI : 10.1287/opre.18.6.1138

M. Held, P. Wolfe, and H. P. Crowder, Validation of subgradient optimization, Mathematical Programming, vol.8, issue.1, pp.62-88, 1974.
DOI : 10.1007/BF01580223

J. H. Holland, Adaptation in natural and artificial systems, 1992.

L. Holm and C. Sander, Protein Structure Comparison by Alignment of Distance Matrices, Journal of Molecular Biology, vol.233, issue.1, pp.123-138, 1993.
DOI : 10.1006/jmbi.1993.1489

L. Holm and C. Sander, The fssp database of structurally aligned protein fold families, Nucleic Acids Research, vol.22, issue.17, pp.3600-3609, 1994.

L. Holm and C. Sander, Mapping the Protein Universe, Science, vol.273, issue.5275, pp.595-602, 1996.
DOI : 10.1126/science.273.5275.595

B. J. Jain and M. Lappe, Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem, Lecture Notes in Computer Science, vol.4414, pp.410-423, 2007.
DOI : 10.1007/978-3-540-71233-6_32

W. Kabsch and C. Sander, Dictionary of protein secondary structure: Pattern recognition of hydrogen-bonded and geometrical features, Biopolymers, vol.33, issue.12, pp.2577-2637, 1983.
DOI : 10.1002/bip.360221211

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

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

R. H. Lathrop, The protein threading problem with sequence amino acid interaction preferences is NP-complete, "Protein Engineering, Design and Selection", vol.7, issue.9, pp.1059-1068, 1994.
DOI : 10.1093/protein/7.9.1059

I. C. Lerman, Likelihood linkage analysis (LLA) classification method: An example treated by hand, Biochimie, vol.75, issue.5, pp.379-397, 1993.
DOI : 10.1016/0300-9084(93)90172-O

I. C. Lerman, P. Peter, and H. Leredde, Principles and calculus of the implanted method in the chavl program (hierarchical classification by the analysis of the likelihood of the bonds) (in french), pp.63-90, 1994.

J. Martin, G. Letellier, A. Marin, J. Taly, A. G. De-brevern et al., Protein secondary structure assignment revisited: a detailed analysis of different assignment methods, BMC Structural Biology, vol.5, issue.1, p.17, 2005.
DOI : 10.1186/1472-6807-5-17

URL : https://hal.archives-ouvertes.fr/inserm-00090199

A. C. May and M. S. Johnson, Protein structure comparisons using a combination of a genetic algorithm, dynamic programming and least-squares minimization, "Protein Engineering, Design and Selection", vol.7, issue.4, pp.475-485, 1994.
DOI : 10.1093/protein/7.4.475

J. Mcgregor, Backtrack search algorithms and the maximal common subgraph. Software Practice abd Experience, pp.23-34, 1982.

N. Metropolis and S. Ulam, The Monte Carlo Method, Journal of the American Statistical Association, vol.44, issue.247, pp.335-341, 1949.
DOI : 10.1080/01621459.1949.10483310

A. G. Murzin, S. E. Brenner, T. Hubbard, and C. Chothia, SCOP: A structural classification of proteins database for the investigation of sequences and structures, Journal of Molecular Biology, vol.247, issue.4, pp.536-540, 1995.
DOI : 10.1016/S0022-2836(05)80134-2

B. Saul, C. D. Needleman, and . Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, vol.48, issue.3, pp.443-453, 1970.

C. A. Orengo, A. D. Michie, S. Jones, D. T. Jones, M. B. Swindells et al., CATH ??? a hierarchic classification of protein domain structures, Structure, vol.5, issue.8, pp.1093-1109, 1997.
DOI : 10.1016/S0969-2126(97)00260-8

P. R. Östergård, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics, vol.120, issue.1-3, pp.197-207, 2002.
DOI : 10.1016/S0166-218X(01)00290-6

P. M. Pardalos and G. P. Rodgers, A branch and bound algorithm for the maximum clique problem, Computers & Operations Research, vol.19, issue.5, pp.363-375, 1992.
DOI : 10.1016/0305-0548(92)90067-F

D. Pelta, J. Gonzales, and M. Vega, A simple and fast heuristic for protein structure comparison, BMC Bioinformatics, vol.9, issue.1, p.161, 2008.
DOI : 10.1186/1471-2105-9-161

G. A. Petsko and D. Ringe, Protein Structure and Function: Primers in Biology, p.86, 2004.

W. Pullan, Protein Structure Alignment Using Maximum Cliques and Local Search, Advances in Artificial Intelligence, pp.776-780, 2007.
DOI : 10.1007/978-3-540-76928-6_91

C. Oliver, A. Redfern, T. Harrison, F. M. Dallman, C. A. Pearl et al., Cathedral: A fast and effective algorithm to predict folds and domain boundaries from multidomain protein structures, PLoS Computational Biology, vol.3, issue.11, pp.2333-2347, 2007.

J. Régin, Using constraint programming to solve the maximum clique problem . CP 2003 : principles and practice of constraint programming, Lecture notes in computer science, pp.634-648, 2003.

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

A. P. Singh and D. L. Brutlag, Protein structure alignment: A comparison of methods, 2000.

T. F. Smith and M. S. Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, vol.147, issue.1, pp.195-197, 1981.
DOI : 10.1016/0022-2836(81)90087-5

R. Sowdhamini and T. L. Blundell, An automatic method involving cluster analysis of secondary structures for the identification of domains in proteins, Protein Science, vol.25, issue.3, pp.506-520, 1995.
DOI : 10.1002/pro.5560040317

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

S. Subbiah, D. V. Laurents, and M. Levitt, Structural similarity of DNA-binding domains of bacteriophage repressors and the globin core, Current Biology, vol.3, issue.3, pp.141-148, 1993.
DOI : 10.1016/0960-9822(93)90255-M

W. R. Taylor, The classification of amino acid conservation, Journal of Theoretical Biology, vol.119, issue.2, pp.205-218, 1986.
DOI : 10.1016/S0022-5193(86)80075-3

I. Wohlers, L. Petzold, F. S. Domingues, and G. Klau, Aligning protein structures using distance matrices and combinatorial optimization, Lecture Notes in Informatics: Proceedings of GCB 2009, 2009.

I. Wohlers, L. Petzold, F. S. Domingues, and G. Klau, PAUL: protein structural alignment using integer linear programming and Lagrangian relaxation, BMC Bioinformatics, vol.10, issue.Suppl 13, p.2, 2009.
DOI : 10.1186/1471-2105-10-S13-P2

J. Xiang and M. Hu, Comparisons of Protein Structure Alignment Methods: Rigid and Flexible, Sequential and Non-Sequential, 2008 2nd International Conference on Bioinformatics and Biomedical Engineering, pp.21-24, 2008.
DOI : 10.1109/ICBBE.2008.12

W. Xie and N. Sahinidis, A Reduction-Based Exact Algorithm for the Contact Map Overlap Problem, Journal of Computational Biology, vol.14, issue.5, pp.637-654, 2007.
DOI : 10.1089/cmb.2007.R007

N. Yanev, P. Veber, R. Andonov, and S. Balev, Lagrangian approaches for a class of matching problems in computational biology, Computers & Mathematics with Applications, vol.55, issue.5, pp.1054-1067, 2008.
DOI : 10.1016/j.camwa.2006.12.103

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

J. Zhu and Z. Weng, FAST: A novel protein structure alignment algorithm, Proteins: Structure, Function, and Bioinformatics, vol.34, issue.Suppl 2, pp.618-627, 2005.
DOI : 10.1002/prot.20331