{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:20Z","timestamp":1774679660241,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437519","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"436-440","source":"Crossref","is-referenced-by-count":25,"title":["On Maximum Likelihood Reconstruction over Multiple Deletion Channels"],"prefix":"10.1109","author":[{"given":"Sundara Rajan","family":"Srinivasavaradhan","sequence":"first","affiliation":[]},{"given":"Michelle","family":"Du","sequence":"additional","affiliation":[]},{"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[]},{"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"li","year":"2009","journal-title":"Fast and accurate short read alignment with burrows-wheeler transform"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw450"},{"key":"ref12","author":"srinivasavaradhan","year":"2017","journal-title":"On maximum likelihood reconstruction over multiple deletion channels"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2950"},{"key":"ref6","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"ACM-SIAM SODA ‘98"},{"key":"ref5","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"SODA ‘02"},{"key":"ref8","article-title":"Average-case reconstruction for the deletion channel: subpolynomially many traces suffice","volume":"abs 1708 854","author":"peres","year":"2017","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref2","article-title":"Models and information-theoretic bounds for nanopore sequencing","volume":"abs 1705 11154","year":"2017","journal-title":"CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006971"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910582"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437519.pdf?arnumber=8437519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:26:14Z","timestamp":1598221574000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437519\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437519","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}