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

DOI10.1007/978-3-030-45257-5_3zbMath1500.92073OpenAlexW3016701095MaRDI QIDQ5041795

Barış Ekim, Yaron Orenstein, Bonnie Berger

Publication date: 14 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45257-5_3

zbMATH Keywords

randomizationparallelizationuniversal hitting sets

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Protein sequences, DNA sequences (92D20) Randomized algorithms (68W20)

Related Items (1)

DeepMinimizer: a differentiable framework for optimizing sequence-specific minimizer schemes

Uses Software

• KMC

Cites Work

• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• A proof of Golomb's conjecture for the de Bruijn graph
• Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption

This page was built for publication: A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets