v0.3

• Implemented the greedy matching algorithm.

v0.2.1

• The second pass of calculating the pBWT arrays is now done in parallel.
• Adjacent segments are now joined from left to right if the number of distinct substrings within the new segment does not exceed the minimum number of founders for the whole input.
• Implemented random matching using 32-bit Mersenne Twister. Earlier the “random” matching was done in pBWT order.
• Disabled experimental and unneeded features in version 0.2.

v0.1

Initial release.