We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent ba1508d commit 7405600Copy full SHA for 7405600
1 file changed
README
@@ -46,7 +46,7 @@ that the total number of k-lets is n^k, where n is the alphabet length. For use
46
cases involving memory constraints, providing the sequence alphabet ahead of
47
time will allow countlets to count k-lets while only needing to load k + 1
48
letters into memory at a time (at the cost of speed for higher k values). When
49
-the alphabet is provided, it will typically never take up more than a couple MBs
+the alphabet is provided, it will typically never take up more than several MBs
50
of memory.
51
52
Example usage:
0 commit comments