A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets

As the volume of next generation sequencing data increases, an urgent need for algorithms to efficiently process the data arises. (UHS) were recently introduced as an alternative to the central idea of minimizers in sequence analysis with the hopes that they could more efficiently address common tas...

Full description

Bibliographic Details

Published in:	Research in computational molecular biology : ... Annual International Conference, RECOMB ... : proceedings. RECOMB (Conference : 2005- ) Vol. 12074; p. 37
Main Authors:	Ekim, Barış, Berger, Bonnie, Orenstein, Yaron
Format:	Journal Article
Language:	English
Published:	Germany 01.01.2020
Subjects:	Universal hitting sets Randomization Parallelization
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!