Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Kayvon Mazooji"'
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74dfc1c8b2f1c3d66456b92c914cbd5b
https://doi.org/10.1109/isit50566.2022.9834518
https://doi.org/10.1109/isit50566.2022.9834518
Publikováno v:
ITW
When an individual's DNA is sequenced, sensitive medical information becomes available to the sequencing laboratory. A recently proposed way to hide an individual's genetic information is to mix in DNA samples of other individuals. We assume these sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3baf4780a15645a2d3b4b5327d824a08
https://doi.org/10.1109/itw46852.2021.9457681
https://doi.org/10.1109/itw46852.2021.9457681
Autor:
Kayvon Mazooji
Publikováno v:
ISIT
For any code, the set of received words generated by insertion errors is infinitely large. We prove that infinitely many of these words are uniquely decodable. We proceed to analyze how often unique decoding from insertions occurs for arbitrary codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64d003d3fb18fb9a7d357a3b124bbc72
https://doi.org/10.1109/isit.2017.8007019
https://doi.org/10.1109/isit.2017.8007019
Publikováno v:
Allerton
Two important recent trends are the proliferation of learning algorithms along with the massive increase of data stored on unreliable storage mediums. These trends impact each other; noisy data can have an undesirable effect on the results provided b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8072aa884d32b2b64b3b5135bae3db0f
https://doi.org/10.1109/allerton.2016.7852288
https://doi.org/10.1109/allerton.2016.7852288
Publikováno v:
ISIT
We study the problem of perfectly reconstructing sequences from traces. The sequences are codewords from a deletion/insertion-correcting code and the traces are the result of corruption by a fixed number of symbol insertions (larger than the minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ca4bb55e078f1490285fe29f8178485
https://doi.org/10.1109/isit.2016.7541372
https://doi.org/10.1109/isit.2016.7541372
De novo assembly of short RNA-Seq reads into transcripts is challenging due to sequence similarities in transcriptomes arising from gene duplications and alternative splicing of transcripts. We present Shannon, an RNA-Seq assembler with an optimality
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d603677f1da17cf8204f48b186d3a7fa
https://doi.org/10.1101/039230
https://doi.org/10.1101/039230
