{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:54:34Z","timestamp":1725486874960},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540715900"},{"type":"electronic","value":"9783540716297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71629-7_45","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T02:33:31Z","timestamp":1183430011000},"page":"399-406","source":"Crossref","is-referenced-by-count":8,"title":["A Branch and Bound Algorithm for Matching Protein Structures"],"prefix":"10.1007","author":[{"given":"Janez","family":"Konc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161anka","family":"Jane\u017ei\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0022-2836(02)00811-2","volume":"323","author":"S. Schmitt","year":"2002","unstructured":"Schmitt, S., Kuhn, D., Klebe, G.: A new method to detect related function among proteins independent of sequence and fold homology. Journal of Molecular Biology\u00a0323, 387\u2013406 (2002)","journal-title":"Journal of Molecular Biology"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457 - Finding all cliques of an undirected graph. Commun. ACM\u00a016, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"45_CR4","volume-title":"Computers and Intractability: A guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"45_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, 197\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1093\/bioinformatics\/14.6.516","volume":"14","author":"X. Pennec","year":"1998","unstructured":"Pennec, X., Ayache, N.: A geometric algorithm to find small but highly similar 3D substructures in proteins. Bioinformatics\u00a014, 516\u2013522 (1998)","journal-title":"Bioinformatics"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design\u00a016, 521\u2013533 (2002)","journal-title":"Journal of Computer-Aided Molecular Design"},{"key":"45_CR8","unstructured":"Konc, J., Jane\u017ei\u010d, D.: A maximum clique problem revisited. European Journal of Operations Research (to appear)"},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1107\/S0567739478001680","volume":"A34","author":"W. Kabsch","year":"1978","unstructured":"Kabsch, W.: A discussion of the solution for the best rotation to relate two sets of vectors. Acta Cryst.\u00a0A34, 827\u2013828 (1978)","journal-title":"Acta Cryst."},{"key":"45_CR10","first-page":"237","volume":"79","author":"J. Konc","year":"2006","unstructured":"Konc, J., Hodo\u0161\u010dek, M., Jane\u017ei\u010d, D.: Molecular surface walk. Croat. Chem. Acta\u00a079, 237\u2013241 (2006)","journal-title":"Croat. Chem. Acta"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1016\/j.steroids.2005.02.022","volume":"70","author":"K. Kristan","year":"2005","unstructured":"Kristan, K., Krajnc, K., Konc, J., Stanislav, G., Stojan, J.: Phytoestrogens as inibitors of fungal 17\u03b2-hydroxysteroid dehydrogenase. Steroids\u00a070, 626\u2013635 (2005)","journal-title":"Steroids"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71629-7_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:24:02Z","timestamp":1605763442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71629-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540715900","9783540716297"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71629-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}