title: Parking strategies for genome sequencing.
abstract: The parking strategy is an iterative approach to DNA sequencing. Each iteration consists of sequencing a novel portion of target DNA that does not overlap any previously sequenced region. Subject to the constraint of no overlap, each new region is chosen randomly. A parking strategy is often ideal in the early stages of a project for rapidly generating unique data. As a project progresses, parking becomes progressively more expensive and eventually prohibitive. We present a mathematical model with a generalization to allow for overlaps. This model predicts multiple parameters, including progress, costs, and the distribution of gap sizes left by a parking strategy. The highly fragmented nature of the gaps left after an initial parking strategy may make it difficult to finish a project efficiently. Therefore, in addition to our parking model, we model gap closing by walking. Our gap-closing model is generalizable to many other strategies. Our discussion includes modified parking strategies and hybrids with other strategies. A hybrid parking strategy has been employed for portions of the Human Genome Project.
authors.affiliation: The Institute for Systems Biology, Seattle, Washington 98105 USA. jroach@systembiology.org
authors.forename: J C
authors.initials: JC
authors.lastname: Roach
authors.forename: V
authors.initials: V
authors.lastname: Thorsson
authors.forename: A F
authors.initials: AF
authors.lastname: Siegel
mesh_terms: D003001:Cloning, Molecular; D003198:Computer Simulation; D015894:Genome, Human; D015698:Genomic Library; D006801:Humans; D008957:Models, Genetic; D015233:Models, Statistical; D017422:Sequence Analysis, DNA / Q000191:economics / Q000379:methods*; D016324:Sequence Tagged Sites