{"title":"On the Coverage Required for Diploid Genome Assembly","authors":"Daanish Mahajan, Chirag Jain, Navin Kashyap","doi":"arxiv-2405.05734","DOIUrl":null,"url":null,"abstract":"We investigate the information-theoretic conditions to achieve the complete\nreconstruction of a diploid genome. We also analyze the standard greedy and\nde-Bruijn graph-based algorithms and compare the coverage depth and read length\nrequirements with the information-theoretic lower bound. Our results show that\nthe gap between the two is considerable because both algorithms require the\ndouble repeats in the genome to be bridged.","PeriodicalId":501070,"journal":{"name":"arXiv - QuanBio - Genomics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - QuanBio - Genomics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.05734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We investigate the information-theoretic conditions to achieve the complete
reconstruction of a diploid genome. We also analyze the standard greedy and
de-Bruijn graph-based algorithms and compare the coverage depth and read length
requirements with the information-theoretic lower bound. Our results show that
the gap between the two is considerable because both algorithms require the
double repeats in the genome to be bridged.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
