On weighted k-mer dictionaries
Abstract We consider the problem of representing a set of $$k$$ k -mers and their abundance counts, or weights, in compressed space so that assessing membership and retrieving the weight of a $$k$$ k -mer is efficient. The representation is called a weighted dictionary of $$k$$ k -mers and finds app...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2023-06-01
|
| Series: | Algorithms for Molecular Biology |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13015-023-00226-2 |