{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T13:44:47Z","timestamp":1725716687488},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642369483"},{"type":"electronic","value":"9783642369490"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36949-0_27","type":"book-chapter","created":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T01:34:27Z","timestamp":1360892067000},"page":"238-247","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Parallelization of the SProt Measure and the TM-Score Algorithm"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Galgonek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kruli\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hoksza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/S0969-2126(97)00260-8","volume":"5","author":"C.A. Orengo","year":"1997","unstructured":"Orengo, C.A., Michie, A.D., Jones, S., Jones, D.T., Swindells, M.B., Thornton, J.M.: CATH\u2013a hierarchic classification of protein domain structures. Structure (London, England: 1993)\u00a05(8), 1093\u20131108 (1997)","journal-title":"Structure (London, England : 1993)"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1093\/protein\/14.4.219","volume":"14","author":"S. Balaji","year":"2001","unstructured":"Balaji, S., Srinivasan, N.: Use of a database of structural alignments and phylogenetic trees in investigating the relationship between sequence and structural variability among homologous proteins. Protein Eng.\u00a014(4), 219\u2013226 (2001)","journal-title":"Protein Eng."},{"issue":"4","key":"27_CR3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1002\/j.1460-2075.1986.tb04288.x","volume":"5","author":"C. Chothia","year":"1986","unstructured":"Chothia, C., Lesk, A.M.: The relation between the divergence of sequence and structure in proteins. The EMBO Journal\u00a05(4), 823\u2013826 (1986)","journal-title":"The EMBO Journal"},{"issue":"7","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1093\/bioinformatics\/bth036","volume":"20","author":"Z. Aung","year":"2004","unstructured":"Aung, Z., Tan, K.L.: Rapid 3D protein structure database searching using information retrieval techniques. Bioinformatics\u00a020(7), 1045\u20131052 (2004)","journal-title":"Bioinformatics"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Tung, C.H.H., Huang, J.W.W., Yang, J.M.M.: Kappa-alpha plot derived structural alphabet and BLOSUM-like substitution matrix for rapid search of protein structure database. Genome Biol. 8(3), R31 (2007)","DOI":"10.1186\/gb-2007-8-3-r31"},{"issue":"24","key":"27_CR6","doi-asserted-by":"publisher","first-page":"2872","DOI":"10.1093\/bioinformatics\/btn545","volume":"24","author":"A. Sacan","year":"2008","unstructured":"Sacan, A., Toroslu, H.I., Ferhatosmanoglu, H.: Integrated search and alignment of protein structures. Bioinformatics\u00a024(24), 2872\u20132879 (2008)","journal-title":"Bioinformatics"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Galgonek, J., Hoksza, D., Skopal, T.: SProt: sphere-based protein structure similarity algorithm. BMC Proteome Science 9(suppl. 1), S20 (2011)","DOI":"10.1186\/1477-5956-9-S1-S20"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol.\u00a048(3), 443\u2013453 (1970)","journal-title":"J. Mol. Biol."},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1002\/prot.20264","volume":"57","author":"Y. Zhang","year":"2004","unstructured":"Zhang, Y., Skolnick, J.: Scoring function for automated assessment of protein structure template quality. Proteins\u00a057(4), 702\u2013710 (2004)","journal-title":"Proteins"},{"issue":"5","key":"27_CR10","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1107\/S0567739476001873","volume":"32","author":"W. Kabsch","year":"1976","unstructured":"Kabsch, W.: A solution for the best rotation to relate two sets of vectors. Acta Crystallogr. A\u00a032(5), 922\u2013923 (1976)","journal-title":"Acta Crystallogr. A"},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"M.L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognition Letters\u00a015(1), 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/3-540-70659-3_75","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Moreno-Seco","year":"2002","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SSPR and SPR 2002. LNCS, vol.\u00a02396, pp. 718\u2013724. Springer, Heidelberg (2002)"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R.A., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv.\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Amdahl, G.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18-20, 1967, Spring Joint Computer Conference, pp. 483\u2013485. ACM (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"27_CR15","unstructured":"Reinders, J.: Intel threading building blocks: outfitting C++ for multi-core processor parallelism. O\u2019Reilly Media, Inc. (2007)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2012: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36949-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:04:09Z","timestamp":1587344649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36949-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642369483","9783642369490"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36949-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}