Algorithms for reconstruction over single and multiple deletion channels. Srinivasavaradhan, S. R., Du, M., Diggavi, S., & Fragouli, C. IEEE Transactions on Information Theory, 67(6):3389-3410, June, 2021. ![Algorithms for reconstruction over single and multiple deletion channels [link]](https://bibbase.org/img/filetypes/link.svg "link")
Arxiv doi abstract bibtex 6 downloads Recent advances in DNA sequencing technology and DNA storage systems have rekindled the interest in deletion channels. Multiple recent works have looked at variants of sequence reconstruction over a single and over multiple deletion channels, a notoriously difficult problem due to its highly combinatorial nature. Although works in theoretical computer science have provided algorithms which guarantee perfect reconstruction with multiple independent observations from the deletion channel, they are only applicable in the large blocklength regime and more restrictively, when the number of observations is also large. Indeed, with only a few observations, perfect reconstruction of the input sequence may not even be possible in most cases. In such situations, maximum likelihood (ML) and maximum aposteriori (MAP) estimates for the deletion channels are natural questions that arise and these have remained open to the best of our knowledge. In this work, we take steps to answer the two aforementioned questions. Specifically: 1. We show that solving for the ML estimate over the single deletion channel (which can be cast as a discrete optimization problem) is equivalent to solving its relaxation, a continuous optimization problem; 2. We exactly compute the symbolwise posterior distributions (under some assumptions on the priors) for both the single as well as multiple deletion channels. As part of our contributions, we also introduce tools to visualize and analyze error events, which we believe could be useful in other related problems concerning deletion channels.
@article{srinivasavaradhan2020algorithms,
abstract = {Recent advances in DNA sequencing technology and DNA storage systems have rekindled the interest in deletion channels. Multiple recent works have looked at variants of sequence reconstruction over a single and over multiple deletion channels, a notoriously difficult problem due to its highly combinatorial nature. Although works in theoretical computer science have provided algorithms which guarantee perfect reconstruction with multiple independent observations from the deletion channel, they are only applicable in the large blocklength regime and more restrictively, when the number of observations is also large. Indeed, with only a few observations, perfect reconstruction of the input sequence may not even be possible in most cases. In such situations, maximum likelihood (ML) and maximum aposteriori (MAP) estimates for the deletion channels are natural questions that arise and these have remained open to the best of our knowledge. In this work, we take steps to answer the two aforementioned questions. Specifically: 1. We show that solving for the ML estimate over the single deletion channel (which can be cast as a discrete optimization problem) is equivalent to solving its relaxation, a continuous optimization problem; 2. We exactly compute the symbolwise posterior distributions (under some assumptions on the priors) for both the single as well as multiple deletion channels. As part of our contributions, we also introduce tools to visualize and analyze error events, which we believe could be useful in other related problems concerning deletion channels.},
author = {Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas and Fragouli, Christina},
journal = {IEEE Transactions on Information Theory},
volume={67},
number={6},
pages={3389-3410},
doi={10.1109/TIT.2020.3033513},
tags = {journal,BioInf,IT,NDS},
title = {Algorithms for reconstruction over single and multiple deletion channels},
type = {2},
url_arxiv = {https://arxiv.org/abs/2005.14388},
ISSN={1557-9654},
month={June},
year = {2021}
}
Downloads: 6
{"_id":"96gRBBQTQheiRfa3q","bibbaseid":"srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021","author_short":["Srinivasavaradhan, S. R.","Du, M.","Diggavi, S.","Fragouli, C."],"bibdata":{"bibtype":"article","type":"2","abstract":"Recent advances in DNA sequencing technology and DNA storage systems have rekindled the interest in deletion channels. Multiple recent works have looked at variants of sequence reconstruction over a single and over multiple deletion channels, a notoriously difficult problem due to its highly combinatorial nature. Although works in theoretical computer science have provided algorithms which guarantee perfect reconstruction with multiple independent observations from the deletion channel, they are only applicable in the large blocklength regime and more restrictively, when the number of observations is also large. Indeed, with only a few observations, perfect reconstruction of the input sequence may not even be possible in most cases. In such situations, maximum likelihood (ML) and maximum aposteriori (MAP) estimates for the deletion channels are natural questions that arise and these have remained open to the best of our knowledge. In this work, we take steps to answer the two aforementioned questions. Specifically: 1. We show that solving for the ML estimate over the single deletion channel (which can be cast as a discrete optimization problem) is equivalent to solving its relaxation, a continuous optimization problem; 2. We exactly compute the symbolwise posterior distributions (under some assumptions on the priors) for both the single as well as multiple deletion channels. As part of our contributions, we also introduce tools to visualize and analyze error events, which we believe could be useful in other related problems concerning deletion channels.","author":[{"propositions":[],"lastnames":["Srinivasavaradhan"],"firstnames":["Sundara","Rajan"],"suffixes":[]},{"propositions":[],"lastnames":["Du"],"firstnames":["Michelle"],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["Suhas"],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["Christina"],"suffixes":[]}],"journal":"IEEE Transactions on Information Theory","volume":"67","number":"6","pages":"3389-3410","doi":"10.1109/TIT.2020.3033513","tags":"journal,BioInf,IT,NDS","title":"Algorithms for reconstruction over single and multiple deletion channels","url_arxiv":"https://arxiv.org/abs/2005.14388","issn":"1557-9654","month":"June","year":"2021","bibtex":"@article{srinivasavaradhan2020algorithms,\n abstract = {Recent advances in DNA sequencing technology and DNA storage systems have rekindled the interest in deletion channels. Multiple recent works have looked at variants of sequence reconstruction over a single and over multiple deletion channels, a notoriously difficult problem due to its highly combinatorial nature. Although works in theoretical computer science have provided algorithms which guarantee perfect reconstruction with multiple independent observations from the deletion channel, they are only applicable in the large blocklength regime and more restrictively, when the number of observations is also large. Indeed, with only a few observations, perfect reconstruction of the input sequence may not even be possible in most cases. In such situations, maximum likelihood (ML) and maximum aposteriori (MAP) estimates for the deletion channels are natural questions that arise and these have remained open to the best of our knowledge. In this work, we take steps to answer the two aforementioned questions. Specifically: 1. We show that solving for the ML estimate over the single deletion channel (which can be cast as a discrete optimization problem) is equivalent to solving its relaxation, a continuous optimization problem; 2. We exactly compute the symbolwise posterior distributions (under some assumptions on the priors) for both the single as well as multiple deletion channels. As part of our contributions, we also introduce tools to visualize and analyze error events, which we believe could be useful in other related problems concerning deletion channels.},\n author = {Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas and Fragouli, Christina},\n journal = {IEEE Transactions on Information Theory},\n volume={67},\n number={6},\n pages={3389-3410},\n doi={10.1109/TIT.2020.3033513},\n tags = {journal,BioInf,IT,NDS},\n title = {Algorithms for reconstruction over single and multiple deletion channels},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/2005.14388},\n ISSN={1557-9654},\n month={June},\n year = {2021}\n}\n\n","author_short":["Srinivasavaradhan, S. R.","Du, M.","Diggavi, S.","Fragouli, C."],"key":"srinivasavaradhan2020algorithms","id":"srinivasavaradhan2020algorithms","bibbaseid":"srinivasavaradhan-du-diggavi-fragouli-algorithmsforreconstructionoversingleandmultipledeletionchannels-2021","role":"author","urls":{" arxiv":"https://arxiv.org/abs/2005.14388"},"metadata":{"authorlinks":{}},"downloads":6},"bibtype":"article","biburl":"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":[],"search_terms":["algorithms","reconstruction","over","single","multiple","deletion","channels","srinivasavaradhan","du","diggavi","fragouli"],"title":"Algorithms for reconstruction over single and multiple deletion channels","year":2021,"downloads":6}