Fig. 5

Illustration of ADAG operation. Top panel. Schematic representation of best path retention in GFA. The green segment is the seed, and blue/gray are the sequence assembly extensions. 1. Example of a GFA before path detection. 2. Removal of segments beyond the maximum distance from the seed. 3. Removal of segments not in a shortest path. Of note, while steps 1–3 are shown sequentially (for better illustration), ADAG completes them in one step. 4. Removal of short end segments. 5. Merging adjacent segments. Note that adjacent segments in a GFA overlap (30 nt) so the length of the merged segment is shorter than the sum of the original segments. Bottom panel. Example of path retention in real GFA. A Original GFA from MetaCherchant with many short segments and loops. B An inset that zooms in GFA to show a complexity of the original assembly. C Final GFA after running ADAG to reduce the overall complexity and remove loops