• Son K. Pham
  • Dmitry Antipov
  • Alexander Sirotkin
  • Glenn Tesler
  • Pavel A. Pevzner
  • Max A. Alekseyev

One of the key advances in genome assembly that has led to a significant improvement in contig lengths has been utilization of paired reads (mate-pairs). While in most assemblers, mate-pair information is used in a post-processing step, the recently proposed Paired de Bruijn Graph (PDBG) approach incorporates the mate-pair information directly in the assembly graph structure. However, the PDBG approach faces difficulties when the variation in the insert sizes is high. To address this problem, we first transform mate-pairs into edge-pair histograms that allow one to better estimate the distance between edges in the assembly graph that represent regions linked by multiple mate-pairs. Further, we combine the ideas of mate-pair transformation and PDBGs to construct new data structures for genome assembly: pathsets and pathset graphs.

Original languageEnglish
Title of host publicationResearch in Computational Molecular Biology - 16th Annual International Conference, RECOMB 2012, Proceedings
Pages200-212
Number of pages13
DOIs
StatePublished - 2012
Event16th Annual International Conference on Research in Computational Molecular Biology - Barcelona, Spain
Duration: 21 Apr 201224 Apr 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7262 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th Annual International Conference on Research in Computational Molecular Biology
Abbreviated titleRECOMB 2012
Country/TerritorySpain
CityBarcelona
Period21/04/1224/04/12

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

ID: 100630943