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: | Ekim, Barış, Berger, Bonnie, Orenstein, Yaron |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Springer International Publishing
2022
|
Online Access: | https://hdl.handle.net/1721.1/145593 |
Similar Items
-
Finding RNA structure in the unstructured RBPome
by: Ohler, Uwe, et al.
Published: (2018) -
Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers
by: Orenstein, Yaron, et al.
Published: (2018) -
RCK: accurate and efficient inference of sequence- and structure-based protein–RNA binding models from RNAcompete data
by: Orenstein, Yaron, et al.
Published: (2018) -
Optimized Sequence Library Design for Efficient In Vitro Interaction Mapping
by: Puccinelli, Robert, et al.
Published: (2018) -
Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer
by: Ekim, Barış, et al.
Published: (2022)