Skip to main content

Table 1 Run times for the different methods, showing the time spent on processing 576 million reads using 24 computing threads

From: Assessing graph-based read mappers against a baseline approach highlights strengths and weaknesses of current methods

Linear mapper12h 51m
- BWA-MEM (tuned)7h1m
- Minimap (tuned)4h40m
- Merging alignments1h10m
Two-step approach24h50m
- Initial rough mapping6h8m
- Predict path through graph and indexing the path with BWA-MEM1h21m
- Running linear mapper on path12h51m
- Post-processing alignments (including conversion to linear reference genome coordinates)4h30m
vg28h52m
  1. Total time is shown in bold text with the time spent for each substep listed below