A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets
© Springer Nature Switzerland AG 2020. As the volume of next generation sequencing data increases, an urgent need for algorithms to efficiently process the data arises. Universal hitting sets (UHS) were recently introduced as an alternative to the central idea of minimizers in sequence analysis with...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing
2022
|
| Online Access: | https://hdl.handle.net/1721.1/145593 |