Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical application to genomic and metagenomic projects
<p>Abstract</p> <p>Background</p> <p>The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is of particular interest. Approximate distributions for the number of...
Main Authors: | Marchesi Julian R, Moriarty John, Metcalfe Anthony |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2007-03-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/8/70 |
Similar Items
-
On Covering Bounded Sets by Collections of Circles of Various Radii
by: A.L. Kazakov, et al.
Published: (2020-03-01) -
Covering of radial segments for domains bounded by k-circles
by: Tetsuo Inoue
Published: (1991-01-01) -
Optimization of a k-covering of a bounded set with circles of two given radii
by: Khorkov Alexander V., et al.
Published: (2021-01-01) -
Bounds for graph energy in terms of vertex covering and clique numbers
by: Hilal A. Ganie, et al.
Published: (2019-10-01) -
Partial covering of a circle by equal circles. Part II: The case of 5 circles
by: Zsolt Gáspár, et al.
Published: (2014-05-01)