{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:37:41Z","timestamp":1773657461543,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540442110","type":"print"},{"value":"9783540457848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_18","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:33:38Z","timestamp":1192545218000},"page":"235-250","source":"Crossref","is-referenced-by-count":37,"title":["MultiProt \u2014 A Multiple Protein Structural Alignment Algorithm"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Shatsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruth","family":"Nussinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim J.","family":"Wolfson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(97)00278-8","volume":"233","author":"T. Akutsu","year":"2000","unstructured":"T. Akutsu and M. M. Halldorson. On the approximation of largest common subtrees and largest common point sets. Theoretical Computer Science, 233:33\u201350, 2000.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0022-2836(87)90521-3","volume":"196","author":"D. Bashford","year":"1987","unstructured":"D. Bashford, C. Chothia, and A.M. Lesk. Determinants of a protein fold. Unique features of the globin amino acid sequences. J Mol Biol., 196(1):199\u2013216, 1987.","journal-title":"J Mol Biol."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry-Algorithms and Applications. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-662-04245-8"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A. Efrat","year":"2001","unstructured":"Alon Efrat, Alon Itai, and Matthew J. Katz. Geometry helps in bottleneck matching and related problems. Algorithmica, 31(1):1\u201328, 2001.","journal-title":"Algorithmica"},{"issue":"5","key":"18_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1089\/106652701446152","volume":"7","author":"I. Eidhammer","year":"2000","unstructured":"I. Eidhammer, I. Jonassen, and WR. Taylor. Structure Comparison and Structure Patterns. J Comput Biol., 7(5):685\u2013716, 2000.","journal-title":"J Comput Biol."},{"key":"18_CR6","unstructured":"D. Fischer, A. Elofsson, D. Rice, and D. Eisenberg. Assessing the performance of fold recognition methods by means of a comprehensive benchmark. In L. Hunter and T. Klein, editors, In Proc. Pacific Symposium on Biocomputing, Singapore, 1996. World Scientific Press."},{"key":"18_CR7","first-page":"459","volume":"248","author":"D. Fischer","year":"1995","unstructured":"D. Fischer, S. L. Lin, H.J. Wolfson, and R. Nussinov. A Geometry-based Suite of Molecular Docking Processes. J. Mol. Biol., 248:459\u2013477, 1995.","journal-title":"J. Mol. Biol."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1006\/jmbi.1993.1489","volume":"233","author":"L. Holm","year":"1993","unstructured":"L. Holm and C. Sander. Protein structure comparison by alignment of distance matrices. J. Mol. Biol., 233(1):123\u201338, 1993.","journal-title":"J. Mol. Biol."},{"key":"18_CR10","first-page":"922","volume":"A32","author":"W. Kabsch","year":"1978","unstructured":"W. Kabsch. A solution for the best rotation to relate two sets of vectors. Acta Crystallogr., A32:922\u2013923, 1978.","journal-title":"Acta Crystallogr"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1107\/S0108767397010325","volume":"A53","author":"TK Kaindl","year":"1997","unstructured":"TK. Kaindl and B. Steipe. Metric properties of the root-mean-square deviation of vector sets. Acta Cryst., A53:809, 1997.","journal-title":"Acta Cryst."},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/prot.1034","volume":"43","author":"N. Leibowitz","year":"2001","unstructured":"N. Leibowitz, Z.Y. Fligelman, R. Nussinov, and H.J. Wolfson. Automated multiple structure alignment and detection of a common substructural motif. Proteins, 43(3):235\u201345, 2001.","journal-title":"Proteins"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1089\/106652701300312896","volume":"8","author":"N. Leibowitz","year":"2001","unstructured":"N. Leibowitz, R. Nussinov, and H.J. Wolfson. MUSTA-a general, efficient, automated method for multiple structure alignment and detection of common motifs: application to proteins. J Comput Biol., 8(2):93\u2013121, 2001.","journal-title":"J Comput Biol."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1008194019144","volume":"14","author":"C. Lemmen","year":"2000","unstructured":"C. Lemmen and T. Lengauer. Computational methods for the structural alignment of molecules. J Comput Aided Mol Des, 14(3):215\u201332, March 2000.","journal-title":"J Comput Aided Mol Des"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"T. Madej, J. Gibrat, and S. Bryant. Threading a database of protein cores, 1995.","DOI":"10.1002\/prot.340230309"},{"key":"18_CR16","unstructured":"K. Mehlhorn. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0022-2836(90)90312-A","volume":"212","author":"E.M. Mitchel","year":"1989","unstructured":"E.M. Mitchel, P.J. Artymiuk, D.W. Rice, and P. Willet. Use of Techniques Derived from Graph Theory to Compare Secondary Structure Motifs in Proteins. J. Mol. Biol., 212:151\u2013166, 1989.","journal-title":"J. Mol. Biol."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1006\/jmbi.1995.0159","volume":"247","author":"A.G. Murzin","year":"1995","unstructured":"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. J. Mol. Biol., 247:536\u2013540, 1995.","journal-title":"J. Mol. Biol."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"R. Nussinov and H.J. Wolfson. Efficient Detection of three-dimensional strcutral motifs in biological macromolecules by computer vision techniques. Proc. Natl. Acad. Sci. USA, 88:10495\u201310499, December 1991. Biophysics.","DOI":"10.1073\/pnas.88.23.10495"},{"key":"18_CR20","first-page":"617","volume-title":"Methods in Enzymology","author":"C.A. Orengo","year":"1996","unstructured":"C.A. Orengo and W.R. Taylor. SSAP: Sequential Structure Alignment Program for Protein Structure Comparison. In R.F. Doolitle, editor, Methods in Enzymology, Vol. 266, pages 617\u2013635. Academic Press, San Diego, 1996."},{"key":"18_CR21","unstructured":"J.-R. Sack and J. Urrutia. Handbook of Computational Geometry (chapter: Discrete Geometric Shapes: Matching, Interpolation, and Approximation). Elsevier, 2000."},{"key":"18_CR22","first-page":"87","volume":"11","author":"B. Sandak","year":"1995","unstructured":"B. Sandak, R. Nussinov, and H.J. Wolfson. An Automated Robotics-Based Technique for Biomolecular Docking and Matching allowing Hinge-Bending Motion. Computer Applications in the Biosciences (CABIOS), 11:87\u201399, 1995.","journal-title":"Computer Applications in the Biosciences (CABIOS)"},{"key":"18_CR23","unstructured":"M. Shatsky, Z.Y. Fligelman, R. Nussinov, and H.J Wolfson. Alignment of Flexible Protein Structures. In 8th International Conference on Intelligent Systems for Molecular Biology, pages 329\u2013343. The AAAI press, August 2000."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1002\/prot.10100","volume":"48","author":"M. Shatsky","year":"2002","unstructured":"M. Shatsky, H.J Wolfson, and R. Nussinov. Flexible protein alignment and hinge detection. Proteins: Structure, Function, and Genetics, 48:242\u2013256, 2002.","journal-title":"Proteins: Structure, Function, and Genetics"},{"issue":"9","key":"18_CR25","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1093\/protein\/11.9.739","volume":"11","author":"I. Shindyalov","year":"1998","unstructured":"I. Shindyalov and P. Bourne. Protein structure alignment by incremental combinatorial extension (ce) of the optimal path. Protein Engineering, 11(9):739\u2013747, 1998.","journal-title":"Protein Engineering"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-2836(89)90084-3","volume":"208","author":"W. R. Taylor","year":"1989","unstructured":"W. R. Taylor and C. A. Orengo. Protein structure alignment. J. Mol. Biol., 208:1\u201322, 1989.","journal-title":"J. Mol. Biol."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/prot.340110107","volume":"11","author":"G. Vriend","year":"1991","unstructured":"G. Vriend and C. Sander. Detection of Common Three-Dimensional Substructures in Proteins. Proteins, 11:52\u201358, 1991.","journal-title":"Proteins"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1089\/cmb.1998.5.585","volume":"5","author":"T.D. Wu","year":"1998","unstructured":"T.D. Wu, S.C. Schmidler, and T. Hastie. Regression analysis of multiple protein structures. J Comput Biol, 5(3):585\u2013595, 1998.","journal-title":"J Comput Biol"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:24:09Z","timestamp":1556915049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}