Skip to content

Commit

Permalink
README contains time estimates to compute masked superstrings.
Browse files Browse the repository at this point in the history
  • Loading branch information
OndrejSladky authored Oct 19, 2024
1 parent abbb8ff commit 7da8c46
Showing 1 changed file with 2 additions and 0 deletions.
2 changes: 2 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -36,6 +36,8 @@ KmerCamel🐫 implements two different algorithms for computing the superstring:
global greedy and local greedy. Global greedy produces more compact superstrings and therefore is the default option,
but local greedy requires less memory and hence can be more suitable in use cases where memory is the main limitation.

To compute masked superstrings takes about 4-10s / 1M k-mers, which means about 5h to compute masked superstrings for the human genome.

All algorithms can be used to either work in the unidirectional model or in the bidirectional model
(i.e. treat $k$-mer and its reverse complement as the same; in this case either of them appears in the result).

Expand Down

0 comments on commit 7da8c46

Please sign in to comment.