Coverage Problem Revisited
Alexey Antonik, Alexandre Berred, Sergey Malov

TL;DR
This paper studies the properties of spacings from continuous distributions, focusing on their asymptotic behavior, and applies these findings to improve genome assembly coverage predictions.
Contribution
It provides new asymptotic results on maximal spacings and applies them to the genome assembly coverage problem.
Findings
Asymptotic behavior of maximal spacings characterized
Results applicable to genome assembly coverage prediction
Enhanced understanding of spacings in continuous distributions
Abstract
Motivated by some problems in genome assembling, we investigate properties of spacings from absolutely continuous distributions. Several results on the asymptotic behavior of the maximal uniform and non-uniform -spacings are presented. Applications of these results to the coverage problem for the prediction stage in genome assembling are also provided.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Stochastic processes and statistical mechanics · Algorithms and Data Compression
