On the Coverage Required for Diploid Genome Assembly

Mahajan, D and Jain, C and Kashyap, N (2024) On the Coverage Required for Diploid Genome Assembly. In: 2024 IEEE International Symposium on Information Theory, ISIT 2024, 7 July 2024through 12 July 2024, Athens, pp. 3636-3641.

PDF IEE_Int_Sym_Inf_The_Pro_3636_3641_24.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

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. © 2024 IEEE.

Item Type:	Conference Paper
Publication:	IEEE International Symposium on Information Theory - Proceedings
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to the Publisher.
Keywords:	Condition; De Bruijn graphs; Genome assembly; Graph-based algorithms; Information-theoretic lower bounds, Information theory
Department/Centre:	Division of Interdisciplinary Sciences > Interdisciplinary Mathematical Sciences
Date Deposited:	23 Sep 2024 08:44
Last Modified:	23 Sep 2024 08:44
URI:	http://eprints.iisc.ac.in/id/eprint/86288

Actions (login required)

View Item