Coverage Problem Revisited

2013/06/21 by Alexey Antonik, Antonik, Alexey, Alexandre Berred +4
Computer Science · Mathematics · #Algorithms and Data Compression #Bayesian Methods and Mixture Models #Stochastic processes and statistical mechanics #math.PR #msc:60F05 #msc:60G70 #msc:62G30 #msc:62G32 #msc:92D20

paper · pdf · doi:10.48550/arxiv.1306.5069

arxiv created 2014/03/30 · arxiv updated 2014/04/01

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 k-spacings are presented. Applications of these results to the coverage problem for the prediction stage in genome assembling are also provided.

Related

• General Coverage Models: Structure, Monotonicity, and Shotgun Sequencing
• Coverage statistics for sequence census methods
• Constructing a genome assembly that has the maximum likelihood
• Hypergraph covering problems motivated by genome assembly questions
• Invariance principle for the coverage rate of genomic physical mappings