On the Coverage Required for Diploid Genome Assembly
<|reference_start|>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.<|reference_end|>
@article{mahajan2024on,
    title={On the Coverage Required for Diploid Genome Assembly},
    author={Daanish Mahajan, Chirag Jain, Navin Kashyap},
    journal={arXiv preprint arXiv:2405.05734},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.05734},
    primaryClass={cs.IT math.IT q-bio.GN}
}