Resolving Multicopy Duplications de novo Using Polyploid Phasing

  • Mark J. Chaisson
  • Sudipto Mukherjee
  • Sreeram Kannan
  • Evan E. Eichler
Conference paper

DOI: 10.1007/978-3-319-56970-3_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10229)
Cite this paper as:
Chaisson M.J., Mukherjee S., Kannan S., Eichler E.E. (2017) Resolving Multicopy Duplications de novo Using Polyploid Phasing. In: Sahinalp S. (eds) Research in Computational Molecular Biology. RECOMB 2017. Lecture Notes in Computer Science, vol 10229. Springer, Cham

Abstract

While the rise of single-molecule sequencing systems has enabled an unprecedented rise in the ability to assemble complex regions of the genome, long segmental duplications in the genome still remain a challenging frontier in assembly. Segmental duplications are at the same time both gene rich and prone to large structural rearrangements, making the resolution of their sequences important in medical and evolutionary studies. Duplicated sequences that are collapsed in mammalian de novo assemblies are rarely identical; after a sequence is duplicated, it begins to acquire paralog-specific variants. In this paper, we study the problem of resolving the variations in multicopy, long segmental duplications by developing and utilizing algorithms for polyploid phasing. We develop two algorithms: the first one is targeted at maximizing the likelihood of observing the reads given the underlying haplotypes using discrete matrix completion. The second algorithm is based on correlation clustering and exploits an assumption, which is often satisfied in these duplications, that each paralog has a sizable number of paralog-specific variants. We develop a detailed simulation methodology and demonstrate the superior performance of the proposed algorithms on an array of simulated datasets. We measure the likelihood score as well as reconstruction accuracy, i.e., what fraction of the reads are clustered correctly. In both the performance metrics, we find that our algorithms dominate existing algorithms on more than 93% of the datasets. While the discrete matrix completion performs better on likelihood score, the correlation-clustering algorithm performs better on reconstruction accuracy due to the stronger regularization inherent in the algorithm. We also show that our correlation-clustering algorithm can reconstruct on average 7.0 haplotypes in 10-copy duplication datasets whereas existing algorithms reconstruct less than one copy on average.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Mark J. Chaisson
    • 1
  • Sudipto Mukherjee
    • 2
  • Sreeram Kannan
    • 2
  • Evan E. Eichler
    • 1
    • 3
  1. 1.Department of Genome SciencesUniversity of WashingtonSeattleUSA
  2. 2.Department of Electrical EngineeringUniversity of WashingtonSeattleUSA
  3. 3.Howard Hughes Medical InstituteUniversity of WashingtonSeattleUSA

Personalised recommendations