Skip to main content

Table 4 Percent of cache misses of the algorithms run on Pandoravirus salinus

From: Fast parallel construction of variable-length Markov chains

Min count

Cunial

Tree

HashMap

1

3.6

50.7

62.9

10

–

32.0

19.5

100

–

15.7

5.5

  1. Data collected using perf version 5.10.g2c85ebc57b3e counting cache misses and cache references. Cunial is superior to our algorithms, and HashMap is worse than Tree for a min count of 1, but better in the other cases
Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us