Table 2 Comparison of the trie-based implementation from [8] and our pBWT-based implementation with minimum block size \(10^6\)
From: Finding all maximal perfect haplotype blocks in linear time
Data set | trie | pBWT | ||
|---|---|---|---|---|
Time | Memory | Time | Memory (MB) | |
chr. 22 | 17 min 08 s | 927.8 MB | 3 min 40 s | 12.8 |
chr. 6 | 1 h 34 min 34 s | 3.23 GB | 16 min 30 s | 12.8 |
chr. 2 | 2 h 07 min 21 s | 4.46 GB | 23 min 24 s | 12.8 |