Efficiently detecting polymorphisms during the fragment assembly process

Bioinformatics. 2002;18 Suppl 1:S294-302. doi: 10.1093/bioinformatics/18.suppl_1.s294.


Motivation: Current genomic sequence assemblers assume that the input data is derived from a single, homogeneous source. However, recent whole-genome shotgun sequencing projects have violated this assumption, resulting in input fragments covering the same region of the genome whose sequences differ due to polymorphic variation in the population. While single-nucleotide polymorphisms (SNPs) do not pose a significant problem to state-of-the-art assembly methods, these methods do not handle insertion/deletion (indel) polymorphisms of more than a few bases.

Results: This paper describes an efficient method for detecting sequence discrepencies due to polymorphism that avoids resorting to global use of more costly, less stringent affine sequence alignments. Instead, the algorithm uses graph-based methods to determine the small set of fragments involved in each polymorphism and performs more sophisticated alignments only among fragments in that set. Results from the incorporation of this method into the Celera Assembler are reported for the D. melanogaster, H. sapiens, and M. musculus genomes.

Publication types

  • Evaluation Study
  • Validation Study

MeSH terms

  • Algorithms*
  • Base Sequence
  • Consensus Sequence / genetics*
  • DNA Fragmentation / genetics*
  • Gene Expression Profiling / methods*
  • Genetic Variation
  • Molecular Sequence Data
  • Polymorphism, Genetic / genetics*
  • Polymorphism, Restriction Fragment Length
  • Sequence Alignment / methods*
  • Sequence Analysis, DNA / methods*