{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,9]],"date-time":"2026-11-09T04:51:53Z","timestamp":1794199913280,"version":"4.8.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T00:00:00Z","timestamp":1357257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1186\/1748-7188-8-1","type":"journal-article","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T02:14:30Z","timestamp":1357265670000},"source":"Crossref","is-referenced-by-count":29,"title":["The difficulty of protein structure alignment under the RMSD"],"prefix":"10.1186","volume":"8","author":[{"given":"Shuai Cheng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,1,4]]},"reference":[{"key":"175_CR1","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1038\/185416a0","volume":"185","author":"MF Perutz","year":"1960","unstructured":"Perutz MF, Rossmann MG, Cullis AF, Muirhead H, Will G: North ACT: Structure of myoglobin: a three-dimensional Fourier synthesis at 5.5 Angstrom resolution. Nature. 1960, 185: 416-422.","journal-title":"Nature"},{"issue":"4","key":"175_CR2","first-page":"1173","volume":"346","author":"PK R Kolodny","year":"2005","unstructured":"R Kolodny PK, Levitt M: Comprehensive evaluation of protein structure alignment methods: scoring by geometric measures. J Comput Biol. 2005, 346 (4): 1173-1188.","journal-title":"J Comput Biol"},{"issue":"6","key":"175_CR3","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1093\/bioinformatics\/btn040","volume":"24","author":"MJ Sippl","year":"2008","unstructured":"Sippl MJ: On distance and similarity in fold space. Bioinformatics. 2008, 24 (6): 872-873.","journal-title":"Bioinformatics"},{"issue":"7","key":"175_CR4","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1110\/ps.04672604","volume":"13","author":"V A Ilyin CML A Abyzov","year":"2004","unstructured":", : Structural alignment of proteins by a novel TOPOFIT method, as a superimposition of common volumes at a topomax point. Protein Sci. 2004, 13 (7): 1865-1874.","journal-title":"Protein Sci"},{"issue":"7","key":"175_CR5","first-page":"1","volume":"5","author":"T Shibuya","year":"2010","unstructured":"Shibuya T, Jansso J, Sadakane K: Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol Biol. 2010, 5 (7): 1-8.","journal-title":"Algorithms Mol Biol"},{"key":"175_CR6","doi-asserted-by":"publisher","first-page":"2834","DOI":"10.1016\/j.tcs.2009.03.023","volume":"410","author":"D Bu","year":"2009","unstructured":"Bu D, Li M, Li SC, Qian J, Xu J: Finding compact structural motifs. Theor Comput Sci. 2009, 410: 2834-2839. 10.1016\/j.tcs.2009.03.023.","journal-title":"Theor Comput Sci"},{"key":"175_CR7","first-page":"52","volume-title":"ESA \u201900: Proceedings of the 8th Annual European Symposium on Algorithms, Volume 1876 of Lecture Notes in Computer Science","author":"C Amb\u00fchl","year":"2000","unstructured":"Amb\u00fchl C, Chakraborty S, G\u00e4rtner B: Computing Largest Common Point Sets under Approximate Congruence. ESA \u201900: Proceedings of the 8th Annual European Symposium on Algorithms, Volume 1876 of Lecture Notes in Computer Science. 2000, 52-63. Saarbr\u00fccken, Germany: Springer-Verlag,"},{"key":"175_CR8","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814624","volume-title":"Algorithmic Aspects of Protein Structure Similarity","author":"D Goldman","year":"1999","unstructured":"Goldman D, Papadimitriou CH, Istrail S: Algorithmic Aspects of Protein Structure Similarity. 1999, New York City, NY, USA: IEEE Computer Society,"},{"key":"175_CR9","first-page":"65","volume-title":"20th International Symposium on Algorithms and Computation, ISAAC 2009, Proceeedings, Volume 5878 of Lecture Notes in Computer Science","author":"SC Li","year":"2009","unstructured":"Li SC, Ng YK: On protein structure alignment under distance constraint. 20th International Symposium on Algorithms and Computation, ISAAC 2009, Proceeedings, Volume 5878 of Lecture Notes in Computer Science. 2009, 65-76. Honolulu, HI, USA: Springer,"},{"key":"175_CR10","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1093\/protein\/7.9.1059","volume":"7","author":"RH Lathrop","year":"1995","unstructured":"Lathrop RH: The Protein Threading Problem With Sequence Amino Acid Interaction Preferences Is NP-Complete. Protein Eng. 1995, 7: 1059-1068.","journal-title":"Protein Eng"},{"issue":"7","key":"175_CR11","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/pro.5560050711","volume":"5","author":"A Godzik","year":"1996","unstructured":"Godzik A: The structural alignment between two proteins: is there a unique answer?. Protein Sci. 1996, 5 (7): 1325-1338.","journal-title":"Protein Sci"},{"issue":"5","key":"175_CR12","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1089\/106652701446152","volume":"7","author":"I Eidhammer","year":"2000","unstructured":"Eidhammer I, Jonassen I, Taylor WR: Structure Comparison and Structure Patterns. J Comput Biol. 2000, 7 (5): 685-716.","journal-title":"J Comput Biol"},{"issue":"5","key":"175_CR13","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1089\/cmb.2008.0075","volume":"15","author":"Z Zhao","year":"2008","unstructured":"Zhao Z, Fu B, Alanis FJ, Summa CM: Feedback algorithm and web-server for protein structure alignment. J Comput Biol. 2008, 15 (5): 505-524.","journal-title":"J Comput Biol"},{"key":"175_CR14","doi-asserted-by":"publisher","first-page":"12201","DOI":"10.1073\/pnas.0404383101","volume":"101","author":"R Kolodny","year":"2004","unstructured":"Kolodny R, Linial N: Approximate Protein Structural Alignment in Polynomial Time. Proc Natl Acad Sci. 2004, 101: 12201-12206.","journal-title":"Proc Natl Acad Sci"},{"key":"175_CR15","first-page":"25","volume-title":"Proc. Pacific Symposium on Biocomputing \u201996","author":"T Akutsu","year":"1996","unstructured":"Akutsu T, Tashimo H: Protein structure comparison using representation by line segment sequences. Proc. Pacific Symposium on Biocomputing \u201996. 1996, 25-40. Hawaii, USA: World Scientific Press,s"},{"issue":"9","key":"175_CR16","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1093\/protein\/9.9.727","volume":"9","author":"NN Alexandrov","year":"1996","unstructured":"Alexandrov NN: SARFing the PDB. Protein Eng. 1996, 9 (9): 727-732.","journal-title":"Protein Eng"},{"key":"175_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/565196.565209","volume-title":"RECOMB \u201902: Proceedings of The Sixth Annual International Conference on Computational Biology","author":"A Caprara","year":"2002","unstructured":"Caprara A, Lancia G: Structural alignment of large-size proteins via lagrangian relaxation. RECOMB \u201902: Proceedings of The Sixth Annual International Conference on Computational Biology. 2002, 100-108. New York, NY, USA: ACM,"},{"key":"175_CR18","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1089\/cmb.2004.11.1061","volume":"11","author":"M Comin","year":"2004","unstructured":"Comin M, Guerra C, Zanotti G: PROuST: A Comparison Method of Three-Dimensional Structure of Proteins using Indexing Techniques. J Comp Biol. 2004, 11: 1061-1072. 10.1089\/cmb.2004.11.1061.","journal-title":"J Comp Biol"},{"key":"175_CR19","first-page":"59","volume-title":"Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology","author":"M Gerstein","year":"1996","unstructured":"Gerstein M, Levitt M: Using Iterative Dynamic Programming to Obtain Accurate Pairwise and Multiple Alignments of Protein Structures. Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology. 1996, 59-67. St. Louis, MO, USA: AAAI Press,"},{"issue":"3","key":"175_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0959-440X(96)80058-3","volume":"6","author":"JF Gibrat","year":"1996","unstructured":"Gibrat JF, Madej T, Bryant SH: Surprising similarities in structure comparison. Curr Opin Struct Biol. 1996, 6 (3): 377-385.","journal-title":"Curr Opin Struct Biol"},{"key":"175_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1006\/jmbi.1993.1489","volume":"233","author":"L Holm","year":"1993","unstructured":"Holm L, Sander C: Protein structure comparison by alignment of distance matrices. J Mol Biol. 1993, 233: 123-138.","journal-title":"J Mol Biol"},{"key":"175_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/369133.369199","volume-title":"RECOMB \u201901: Proceedings of The Fifth Annual International Conference on Computational Biology","author":"G Lancia","year":"2001","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. RECOMB \u201901: Proceedings of The Fifth Annual International Conference on Computational Biology. New York, NY, USA: ACM 2001, 193-202.."},{"key":"175_CR23","first-page":"284","volume-title":"Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology","author":"AP Singh","year":"1997","unstructured":"Singh AP, Brutlag DL: Hierarchical Protein Structure Superposition Using Both Secondary Structure and Atomic Representations. Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology. 1997, 284-293. Halkidiki, Greece: AAAI Press,"},{"key":"175_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE: The protein data bank. Nucl Acids Res. 2000, 28: 235-242. [\n                    http:\/\/nar.oxfordjournals.org\/cgi\/content\/abstract\/28\/1\/235\n                    \n                  ], []","journal-title":"Nucl Acids Res"},{"issue":"3","key":"175_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C Papadimitriou","year":"1977","unstructured":"Papadimitriou C: The Euclidean Traveling Salesman Problem is NP-Complete. Theoretial Compututer Sci. 1977, 4 (3): 237-244. 10.1016\/0304-3975(77)90012-3.","journal-title":"Theoretial Compututer Sci"},{"issue":"5","key":"175_CR26","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TPAMI.1987.4767965","volume":"9","author":"KS Arun","year":"1987","unstructured":"Arun KS, Huang TS, Blostein SD: Least-squares fitting of two 3-D point sets. IEEE Trans Pattern Anal Mach Intell. 1987, 9 (5): 698-700.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"175_CR27","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB: Network Flows: Theory, Algorithms, and Applications. 1993, Englewood Cliffs, NJ: Prentice Hall,"},{"key":"175_CR28","volume-title":"A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials","year":"1998","unstructured":"A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials. Edited by: Caviness B, Johnson J. Springer Vienna: Springer-Verlag 1998."},{"issue":"4","key":"175_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01293487","volume":"13","author":"PJ de Rezende","year":"1995","unstructured":"de Rezende PJ, Lee DT: Point Set Pattern Matching in d-Dimensions. Algorithmica. 1995, 13 (4): 387-404. 10.1007\/BF01293487.","journal-title":"Algorithmica"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-8-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T18:49:56Z","timestamp":1548096596000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-8-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,4]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-8-1","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,4]]},"article-number":"1"}}