{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:50:48Z","timestamp":1729641048269,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875042","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"1296-1300","source":"Crossref","is-referenced-by-count":4,"title":["Quadratic-backtracking algorithm for string reconstruction from substring compositions"],"prefix":"10.1109","author":[{"given":"Jayadev","family":"Acharya","sequence":"first","affiliation":[]},{"given":"Hirakendu","family":"Das","sequence":"additional","affiliation":[]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[]},{"given":"Alon","family":"Orlitsky","sequence":"additional","affiliation":[]},{"given":"Shengjun","family":"Pan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"17"},{"key":"18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.37236\/161","article-title":"Counting abelian squares","volume":"16","author":"richmond","year":"2009","journal-title":"Electronic Journal of Combinatorics"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90195-4"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.235"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-02-01428-X"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22321-1_20"},{"journal-title":"On the Turnpike Problem","year":"2000","author":"dakic","key":"12"},{"key":"3","article-title":"Order from disorder","author":"das","year":"2009","journal-title":"Information Theory and Applications Workshop"},{"journal-title":"Bioinformatics Sequence and Genome Analysis","year":"2001","author":"mount","key":"2"},{"journal-title":"Proteins Structures and Molecular Properties","year":"1992","author":"creighton","key":"1"},{"key":"10","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"viswanathan","year":"2008","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492591"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98598"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513668"},{"key":"9","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(03)00103-1"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875042.pdf?arnumber=6875042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:21:52Z","timestamp":1602674512000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875042","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}