Dynamic compression schemes for graph coloring
Harun Mustafa, Ingo Schilken, Mikhail Karasikov, Carsten Eickhoff, Gunnar Rätsch, André Kahles
The paper introduces two compression methods for graph coloring in sequencing data, reducing memory use by up to three orders of magnitude while maintaining dynamic graph topology.
Bioinformatics · Jul 16, 2018Peer-reviewedBioinformatics