Article version of the algorithm. Includes a new haploid option (-H), when trying to improve the contiguity of a collapsed assembly. Also added some input/output options for more convenient usage.
2.0
A brand new Hi-C algorithm, capable of untangling much more while being significantly faster.
1.2.1
Nothing fundamental changed from version 1.2.0. Correction of a few bugs and addition of a security, checking that the input alignments are compatible with the graph.
1.2.0
This release implements the new long read algorithm of GraphUnzip, inspired by the software Unicycler.