Generating minimum-density minimizers
Arseny M. Shur, Ido Tziony, Yaron Orenstein
This paper introduces an algorithm to compute minimum-density minimizers for high-throughput sequencing, achieving faster results than brute-force methods.
Author
Bar-Ilan UniversityORCID 0009-0000-5738-0882Unclaimed ORCID profile · follow to get notified of new preprints
5 papers
Recent·Most cited
Arseny M. Shur, Ido Tziony, Yaron Orenstein
This paper introduces an algorithm to compute minimum-density minimizers for high-throughput sequencing, achieving faster results than brute-force methods.
Nikita Gryzunov, Dmitry Penzar, Vasilii Kamenets…·Ivan V. Kulakovskiy
The paper benchmarks methods for inferring transcription factor binding specificities using a large community challenge and finds deep learning models outperform traditional methods, though positional weight matrices are competitive.
CROP predicts CRISPR-Cas9 frameshift rates using a context-aware, feature-independent method, outperforming existing approaches across multiple datasets.
Arseny M. Shur, Ido Tziony, Yaron Orenstein
This paper introduces 10-minimizers, a class of constant-space minimizers with lower density than random minimizers and efficient k-mer key retrieval.