arrow
Return

DCHap: A Divide-and-Conquer Haplotype Phasing Algorithm for Third-Generation Sequences

delete2022-05-01
delete2
PRE
AI
Y
Yanbo Li
Y
Yu Lin *
DOI:10.1109/TCBB.2020.3005673delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The development of DNA sequencing technologies makes it possible to obtain reads originated from both copies of a chromosome (two parental chromosomes, or haplotypes) of a single individual. Reconstruction of both haplotypes (i.e., haplotype phasing) plays a crucial role in genetic analysis and provides relationship information between genetic variation and disease susceptibility. With the emerging third-generation sequencing technologies, most existing approaches for haplotype phasing suffer from performance issues to handle long and error-prone reads. We develop a divide-and-conquer algorithm, DCHap, to phase haplotypes using third-generation reads. We benchmark DCHap against three state-of-the-art phasing tools on both PacBio SMRT data and ONT Nanopore data. The experimental results show that DCHap generates more accurate or comparable results (measured by the switch errors) while being scalable for higher coverage and longer reads. DCHap is a fast and accurate algorithm for haplotype phasing using third-generation sequencing data. As the third-generation sequencing platforms continue improving on their throughput and read lengths, accurate and scalable tools like DCHap are important to improve haplotype phasing from the advances of sequencing technologies. The source code is freely available at https://github.com/yanboANU/Haplotype-phasing.
Keywords:
Reliability
Microsoft Windows
Sequential analysis
Genomics
Bioinformatics
Bridges
Biological cells
Haplotype phasing
third-generation sequencing
divide-and-conquer

Journal

I
IEEE-ACM Transactions on Computational Biology and Bioinformatics
IF:
3.4
Papers:
3.3K
Citations:
6.4K

Organization

A
Australian National University
Scholars:
2.1W
Papers: 2.3W
Citations: 3.9W