Table 4 Comparison of our algorithm with VELVET on a 32-bit machine with 1 GB of RAM
From: Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
OUT OF CORE | VELVET | |||||
|---|---|---|---|---|---|---|
reads | initial edges | edges after multiplicity reduction and canonicalization | page faults | time hrs:min:sec | page faults | Time hrs:min:sec |
2097152 | 31457280 | 21387750 | 5593 | 00:10:31 | 82 | 00:4:31 |
4194304 | 62914560 | 32443128 | 23084 | 00:22:40 | 2419455 | 07:50:02* |
6291456 | 94371840 | 39460652 | 40920 | 00:34:09 | 1255816 | 04:22:28* |
8388608 | 125829120 | 44840055 | 45716 | 00:38:13 | 1064952 | 03:50:02* |