{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:57:26Z","timestamp":1730206646651,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1109\/cibcb.2017.8058537","type":"proceedings-article","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T16:28:38Z","timestamp":1507220918000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Finding sub-graphs from contact map overlap problem"],"prefix":"10.1109","author":[{"given":"K Suvarna","family":"Vani","sequence":"first","affiliation":[]},{"given":"K Praveen","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"M Veda","family":"Sri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Fast overlapping of protein contact maps by alignment of eigenvectors","author":"pietro","year":"2010","journal-title":"Bioinformatics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.24"},{"key":"ref12","first-page":"152","author":"shibberu","year":"2010","journal-title":"Fast protein structure alignment LNCS Springer-Verlag"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-161"},{"key":"ref14","article-title":"Bimal: Bipartite matching alignment for the contact map overlap problem","author":"brijnesh","year":"2009","journal-title":"IJCNN"},{"year":"0","key":"ref15"},{"journal-title":"Felipe Leal Valentim Protein structure comparison via contact map alignment","year":"2010","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511806452"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CIBCB.2015.7300329"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87361-7_14"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/565196.565209"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.R007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0189"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814624"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0004"},{"key":"ref2","article-title":"A branch and cut algorithm for the maximum contact map overlap problem","author":"lancia","year":"2001","journal-title":"RECOMB annual international conference on computational molecular biology"},{"key":"ref1","volume":"12","author":"suvarna","year":"2015","journal-title":"Divide and Conquer Approach to Contact Map Overlap Problem using 2D-Pattern Mining of Protein Contact Networks"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.R003"}],"event":{"name":"2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","start":{"date-parts":[[2017,8,23]]},"location":"Manchester, United Kingdom","end":{"date-parts":[[2017,8,25]]}},"container-title":["2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8052580\/8058518\/08058537.pdf?arnumber=8058537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:34:24Z","timestamp":1513179264000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8058537\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/cibcb.2017.8058537","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}