Resolve repeats using reads
Having build the de Bruijn graph using words, our de novo assembler removes repeats and errors using reads. This is done in the following order:
- Remove weak edges
- Remove dead ends
- Resolve repeats using reads without conflicts
- Resolve repeats with conflicts
- Remove weak edges
- Remove dead ends
Subsections