二倍体基因组组装所需的覆盖率

arXiv - QuanBio - Genomics Pub Date : 2024-05-09 DOI:arxiv-2405.05734

Daanish Mahajan, Chirag Jain, Navin Kashyap

{"title":"二倍体基因组组装所需的覆盖率","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":"73 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"73 1\",\"pages\":\"\"},\"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}","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

摘要

我们研究了实现完整重建二倍体基因组的信息论条件。我们还分析了标准的贪婪算法和德布鲁因图算法，并将覆盖深度和读长要求与信息理论下限进行了比较。结果表明，由于这两种算法都要求弥合基因组中的双重复序列，因此两者之间的差距相当大。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the Coverage Required for Diploid Genome Assembly

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - QuanBio - Genomics

自引率

0.00%

发文量