Subgraph assembly reimplemented: acyclic optimal assembly now default
Now anchoring to reference when required (assembly contains at least one anchored read)
All starting kmers are now considered in greedy traversal
Note: expensive assert() statements have been left in so we catch remaining bugs when processing on large-scale data sets