Skip to main content

Combinatorial Algorithms for Structural Variation Detection in High Throughput Sequenced Genomes

  • Conference paper
Research in Computational Molecular Biology (RECOMB 2009)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 5541))

Abstract

Recent studies show that, along with single nucleotide polymorphisms and small indels, larger structural variants among human individuals are common. These studies have typically been based high-cost library generation and Sanger sequencing; however, recent introduction of next-generation sequencing (NGS) technologies is changing how research in this area is conducted in a significant way. Highthroughput sequencing technologies such as 454, Illumina, Helicos, and AB SOLiD produce shorter reads than the traditional capillary sequencing, yet they reduce the cost (and/or the redundancy) by a factor of 10 - 100 and perhaps even more. Those NGS technologies with the capability of sequencing paired-ends (or matepairs) of a clone insert (which follows a tight length distribution) have made it feasible to perform detailed and comprehensive genome variation and rearrangement studies. Unfortunately, the few existing algorithms for identifying structural variation among individuals using paired-end reads have not been designed to handle the short read lengths and the errors implied by these platforms. Here, we describe, for the first time, algorithms for identifying various forms of structural variation between a paired-end NGS sequenced genome and a reference genome.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hormozdiari, F., Alkan, C., Eichler, E.E., Sahinalp, S.C. (2009). Combinatorial Algorithms for Structural Variation Detection in High Throughput Sequenced Genomes. In: Batzoglou, S. (eds) Research in Computational Molecular Biology. RECOMB 2009. Lecture Notes in Computer Science(), vol 5541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02008-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02008-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02007-0

  • Online ISBN: 978-3-642-02008-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics