{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:09:18Z","timestamp":1757455758982,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Malaysian Ministry of Higher Education","doi-asserted-by":"publisher","award":["FRGS\/2\/2010\/SG\/UTAR\/03\/2"],"award-info":[{"award-number":["FRGS\/2\/2010\/SG\/UTAR\/03\/2"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council of the Hong Kong Special Administrative Region","doi-asserted-by":"publisher","award":["CityU 124512"],"award-info":[{"award-number":["CityU 124512"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2015,5,1]]},"DOI":"10.1109\/tcbb.2014.2372782","type":"journal-article","created":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T15:28:15Z","timestamp":1416497295000},"page":"644-655","source":"Crossref","is-referenced-by-count":2,"title":["Finding All Longest Common Segments in Protein Structures Efficiently"],"prefix":"10.1109","volume":"12","author":[{"family":"Yen Kaow Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Linzhi Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Shuai Cheng Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1107\/S0567739476001873"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1107\/S0567739478001680"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1002\/prot.10535","article-title":"Livebench-6: Large-scale automated evaluation of protein structure prediction servers","volume":"53","author":"leszek","year":"2003","journal-title":"Proteins"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2010.0123"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0217"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.9.776"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1997.0959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2011.0230"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/34.88573"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1186\/1741-7007-5-17"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1126\/science.1853201","article-title":"A method to identify protein sequences that fold into a known three-dimensional structure","volume":"253","author":"bowie","year":"1991","journal-title":"Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1987.4767965"},{"key":"ref6","first-page":"285","article-title":"A combinatorial shape matching algorithm for rigid protein docking","author":"choi","year":"0","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0959-440X(95)80082-4"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1186\/1471-2105-2-5","article-title":"A study of quality measures for protein threading models","volume":"2","author":"cristobal","year":"2001","journal-title":"BMC Bioinformatics"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref7"},{"key":"ref2","first-page":"52","article-title":"Computing largest common point sets under approximate congruence","author":"amb\u00fchl","year":"0","journal-title":"Proc 8th Annu Eur Symp Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/358086a0"},{"key":"ref1","first-page":"1629","article-title":"Protein structure alignment using dynamic programming and iterative improvement","volume":"e79 d","author":"akutsu","year":"1996","journal-title":"IEICE Trans Inf Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg571"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/7116662\/06963458.pdf?arnumber=6963458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:30:09Z","timestamp":1641987009000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6963458\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,1]]},"references-count":20,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2014.2372782","relation":{},"ISSN":["1545-5963"],"issn-type":[{"type":"print","value":"1545-5963"}],"subject":[],"published":{"date-parts":[[2015,5,1]]}}}