Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length

DOI10.1007/978-3-030-45257-5_13zbMath1500.92082arXiv2001.06550OpenAlexW3117679888MaRDI QIDQ5040364

Guillaume Marçais, Hongyu Zheng, Carl Kingsford

Publication date: 14 October 2022

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

Full work available at URL: https://arxiv.org/abs/2001.06550

zbMATH Keywords

minimizersde Bruijn graphdepathing setuniversal hitting set

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Uses Software

• KMC
• Minimap2
• Winnowing

Cites Work

• A proof of Golomb's conjecture for the de Bruijn graph
• UNAVOIDABLE SETS OF CONSTANT LENGTH
• Unnamed Item

This page was built for publication: Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length