{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T22:50:01Z","timestamp":1773960601331,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_10","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"106-117","source":"Crossref","is-referenced-by-count":19,"title":["Maximum Cliques in Protein Structure Comparison"],"prefix":"10.1007","author":[{"given":"No\u00ebl","family":"Malod-Dognin","sequence":"first","affiliation":[]},{"given":"Rumen","family":"Andonov","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Yanev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Godzik, A.: The structural alignment between two proteins: Is there a unique answer? Protein Science\u00a0(7), 1325\u20131338 (1996)","DOI":"10.1002\/pro.5560050711"},{"issue":"12","key":"10_CR2","first-page":"2103","volume":"12","author":"M. Sierk","year":"2004","unstructured":"Sierk, M., Kleywegt, G.: D\u00e9j\u00e0 vu all over again: Finding and analyzing protein structure similarities. Structure\u00a012(12), 2103\u20132111 (2004)","journal-title":"Structure"},{"key":"10_CR3","first-page":"220","volume":"58","author":"J. Konc","year":"2003","unstructured":"Konc, J., Janezic, D.: An efficient branch-and-bound algorithm for finding a maximum clique. Discrete Mathematics and Theoretical Computer Science\u00a058, 220 (2003)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"10_CR4","first-page":"569","volume":"58","author":"E. Tomita","year":"2007","unstructured":"Tomita, E., Seki, T.: An improved branch and bound algorithm for the maximum clique problem. Communications in Mathematical and in Computer Chemistry \/ MATCH\u00a058, 569\u2013590 (2007)","journal-title":"Communications in Mathematical and in Computer Chemistry \/ MATCH"},{"issue":"1-3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics\u00a0120(1-3), 197\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1093\/nar\/gkm993","volume":"36","author":"A. Andreeva","year":"2007","unstructured":"Andreeva, A., Howorth, D., Chandonia, J.M., Brenner, S., Hubbard, T., Chothia, C., Murzin, A.: Data growth and its impact on the SCOP database: new developments. Nucl. Acids Res.\u00a036, 419\u2013425 (2007)","journal-title":"Nucl. Acids Res."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/opre.1040.0189","volume":"53","author":"D. Strickland","year":"2005","unstructured":"Strickland, D., Barnes, E., Sokol, J.: Optimal protein structure alignment using maximum cliques. Oper. Res.\u00a053(3), 389\u2013402 (2005)","journal-title":"Oper. Res."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"6","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations\u00a06, 85\u2013103 (1972)","journal-title":"Complexity of Computer Computations"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0959-440X(96)80058-3","volume":"6","author":"J.F. Gibrat","year":"1996","unstructured":"Gibrat, J.F., Madej, T., Bryant, S.: Surprising similarities in structure comparison. Current Opinion in Structural Biology\u00a06, 377\u2013385 (1996)","journal-title":"Current Opinion in Structural Biology"},{"key":"10_CR11","first-page":"587","volume":"10","author":"A. Godzik","year":"1994","unstructured":"Godzik, A., Skolnick, J.: Flexible algorithm for direct multiple alignment of protein structures and sequences. CABIOS\u00a010, 587\u2013596 (1994)","journal-title":"CABIOS"},{"key":"10_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-87361-7_14","volume-title":"Algorithms in Bioinformatics","author":"R. Andonov","year":"2008","unstructured":"Andonov, R., Yanev, N., Malod-Dognin, N.: An efficient lagrangian relaxation for the contact map overlap problem. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 162\u2013173. Springer, Heidelberg (2008)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1089\/106652704773416876","volume":"11","author":"A. Caprara","year":"2004","unstructured":"Caprara, A., Carr, R., Israil, S., Lancia, G., Walenz, B.: 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap. J. Comput. Biol.\u00a011(1), 27\u201352 (2004)","journal-title":"J. Comput. Biol."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M. Fredman","year":"1975","unstructured":"Fredman, M.: On computing the length of longest increasing subsequences. Discrete Mathematics\u00a011, 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1186\/1472-6807-5-17","volume":"5","author":"J. Martin","year":"2005","unstructured":"Martin, J., Letellier, G., Marin, A., Taly, J.F., de Brevern, A., Gibrat, J.F.: Protein secondary structure assignment revisited: a detailed analysis of different assignment methods. BMC Structural Biology\u00a05, 17 (2005)","journal-title":"BMC Structural Biology"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Lancia, G., Carr, R., Walenz, B., Istrail, S.: 101 optimal pdb structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. In: RECOMB 2001: Proceedings of the fifth annual international conference on Computational biology, pp. 193\u2013202 (2001)","DOI":"10.1145\/369133.369199"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0300-9084(93)90172-O","volume":"75","author":"I. Lerman","year":"1993","unstructured":"Lerman, I.: Likelihood linkage analysis (lla) classification method (around an example treated by hand). Biochimie\u00a075(5), 379\u2013397 (1993)","journal-title":"Biochimie"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:57:16Z","timestamp":1619769436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}