On maximum likelihood reconstruction over multiple deletion channels. Srinivasavaradhan, S. R., Du, M., Diggavi, S., & Fragouli, C. In 2018 IEEE International Symposium on Information Theory (ISIT), pages 436–440, 2018. IEEE. doi abstract bibtex The problem of reconstructing a sequence when observed through multiple looks over deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced multiple times, yielding several “looks” of it, but each time the sequencer could be noisy with (independent) deletion impairments. The main goal of this paper is to develop reconstruction algorithms for a sequence observed through the lens of a fixed number of deletion channels. We use the probabilistic model of the deletion channels to develop both symbol-wise and sequence maximum likelihood decoding criteria, and algorithms motivated by them. Numerical evaluations demonstrate improvement in terms of edit distance error, over earlier algorithms.
@inproceedings{srinivasavaradhan2018maximum,
abstract = {The problem of reconstructing a sequence when observed through multiple looks over deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced multiple times, yielding several “looks” of it, but each time the sequencer could be noisy with (independent) deletion impairments. The main goal of this paper is to develop reconstruction algorithms for a sequence observed through the lens of a fixed number of deletion channels. We use the probabilistic model of the deletion channels to develop both symbol-wise and sequence maximum likelihood decoding criteria, and algorithms motivated by them. Numerical evaluations demonstrate improvement in terms of edit distance error, over earlier algorithms.},
author = {Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas and Fragouli, Christina},
booktitle = {2018 IEEE International Symposium on Information Theory (ISIT)},
organization = {IEEE},
pages = {436--440},
tags = {conf,BioInf,IT,NDS},
title = {On maximum likelihood reconstruction over multiple deletion channels},
type = {4},
doi = {10.1109/ISIT.2018.8437519},
year = {2018}
}
Downloads: 0
{"_id":"NAjzRFoLYdFcZzMDG","bibbaseid":"srinivasavaradhan-du-diggavi-fragouli-onmaximumlikelihoodreconstructionovermultipledeletionchannels-2018","author_short":["Srinivasavaradhan, S. R.","Du, M.","Diggavi, S.","Fragouli, C."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"The problem of reconstructing a sequence when observed through multiple looks over deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced multiple times, yielding several “looks” of it, but each time the sequencer could be noisy with (independent) deletion impairments. The main goal of this paper is to develop reconstruction algorithms for a sequence observed through the lens of a fixed number of deletion channels. We use the probabilistic model of the deletion channels to develop both symbol-wise and sequence maximum likelihood decoding criteria, and algorithms motivated by them. Numerical evaluations demonstrate improvement in terms of edit distance error, over earlier algorithms.","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":[]}],"booktitle":"2018 IEEE International Symposium on Information Theory (ISIT)","organization":"IEEE","pages":"436–440","tags":"conf,BioInf,IT,NDS","title":"On maximum likelihood reconstruction over multiple deletion channels","doi":"10.1109/ISIT.2018.8437519","year":"2018","bibtex":"@inproceedings{srinivasavaradhan2018maximum,\n abstract = {The problem of reconstructing a sequence when observed through multiple looks over deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced multiple times, yielding several “looks” of it, but each time the sequencer could be noisy with (independent) deletion impairments. The main goal of this paper is to develop reconstruction algorithms for a sequence observed through the lens of a fixed number of deletion channels. We use the probabilistic model of the deletion channels to develop both symbol-wise and sequence maximum likelihood decoding criteria, and algorithms motivated by them. Numerical evaluations demonstrate improvement in terms of edit distance error, over earlier algorithms.},\n author = {Srinivasavaradhan, Sundara Rajan and Du, Michelle and Diggavi, Suhas and Fragouli, Christina},\n booktitle = {2018 IEEE International Symposium on Information Theory (ISIT)},\n organization = {IEEE},\n pages = {436--440},\n tags = {conf,BioInf,IT,NDS},\n title = {On maximum likelihood reconstruction over multiple deletion channels},\n type = {4},\n doi = {10.1109/ISIT.2018.8437519},\n year = {2018}\n}\n\n","author_short":["Srinivasavaradhan, S. R.","Du, M.","Diggavi, S.","Fragouli, C."],"key":"srinivasavaradhan2018maximum","id":"srinivasavaradhan2018maximum","bibbaseid":"srinivasavaradhan-du-diggavi-fragouli-onmaximumlikelihoodreconstructionovermultipledeletionchannels-2018","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib","dataSources":["ZyBHKCcCyS7Qk9n3w","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":[],"search_terms":["maximum","likelihood","reconstruction","over","multiple","deletion","channels","srinivasavaradhan","du","diggavi","fragouli"],"title":"On maximum likelihood reconstruction over multiple deletion channels","year":2018}