Hi Chris,
Thank you for providing the log, it is very helpful. I see that all attempts to close gaps are failing with the "Too many branches" outcome. That means that the graph search algorithm which tries to connect the two flanks is hitting its internal limit for the breadth of the search frontier -- in other words, the graph search space gets big and hairy and it gives up.
The first thing to check is that the Bloom filter that is built by Sealer has a reasonable false positive rate (FPR). The Bloom filter FPR should be reported somewhere in the log file, and you should make sure that the FPR is < 20%. The lower the better. If the FPR is too high, you can fix that by increasing the amount of memory allocated for the Bloom filter with the `-b` option (e.g. "-b 20G").
If the Bloom filter FPR is not the problem, you may be able to improve your results by adjusting parameter settings. Things that might help are:
* increasing -k (increasing k results in a less tangled de Bruijn graph). This will decrease run time.