Sequencing a Genome by Walking with Clone-End Sequences: A Mathematical Analysis

  1. Serafim Batzoglou1,
  2. Bonnie Berger1,2,
  3. Jill Mesirov4, and
  4. Eric S. Lander3,4,5
  1. 1Laboratory for Computer Science and Departments of 2Mathematics and 3Biology, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA; 4Whitehead Institute for Biomedical Research, Nine Cambridge Center, Cambridge, Massachusetts 02142 USA

Abstract

One approach to sequencing a large genome is (1) to sequence a collection of nonoverlapping “seeds” chosen from a genomic library of large-insert clones [such as bacterial artificial chromosomes (BACs)] and then (2) to take successive “walking” steps by selecting and sequencing minimally overlapping clones, using information such as clone-end sequences to identify the overlaps. In this paper we analyze the strategic issues involved in using this approach. We derive formulas showing how two key factors, the initial density of seed clones and the depth of the genomic library used for walking, affect the cost and time of a sequencing project—that is, the amount of redundant sequencing and the number of steps to cover the vast majority of the genome. We also discuss a variant strategy in which a second genomic library with clones having a somewhat smaller insert size is used to close gaps. This approach can dramatically decrease the amount of redundant sequencing, without affecting the rate at which the genome is covered.

Footnotes

  • 5 Corresponding author.

  • E-MAIL lander{at}genome.wi.mit.edu; FAX (617) 252-1902.

    • Received July 22, 1999.
    • Accepted October 29, 1999.
| Table of Contents

Preprint Server