Improving the efficiency of de Bruijn graph construction using compact universal hitting sets
Yael Ben-Ari, Dan Flomin, Lianrong Pu, Yaron Orenstein, Ron Shamir A
The paper demonstrates that using universal hitting sets improves de Bruijn graph construction efficiency by reducing runtime and memory usage in genome assembly.
ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB) · Jul 30, 2021Peer-reviewedBioinformatics