#34 A greedy assembler

[Jason Rafe Miller]

Deploy a program that does greedy assembly. It would start from an
arbitrary fragment end and iteratively grow a contig. Each iteration would
attach the one fragment with the thickest overlap to the current contig.

This would be a diagnostic tool. One would compare its output to that of
unitigger, which is not greedy. One would not release greedy contigs,
which would tend to be chimeric.

Aaron Halpern has such a program. It may need only documentation.

Document how to use this program to diagnose problems with unitigger.