PWHATSHAP: efficient haplotyping for future generation sequencing. Issue 11 (September 2016)
- Record Type:
- Journal Article
- Title:
- PWHATSHAP: efficient haplotyping for future generation sequencing. Issue 11 (September 2016)
- Main Title:
- PWHATSHAP: efficient haplotyping for future generation sequencing
- Authors:
- Bracciali, Andrea
Aldinucci, Marco
Patterson, Murray
Marschall, Tobias
Pisanti, Nadia
Merelli, Ivan
Torquati, Massimo - Abstract:
- Abstract Background Haplotype phasing is an important problem in the analysis of genomics information. Given a set of DNA fragments of an individual, it consists of determining which one of the possible alleles (alternative forms of a gene) each fragment comes from. Haplotype information is relevant to gene regulation, epigenetics, genome-wide association studies, evolutionary and population studies, and the study of mutations. Haplotyping is currently addressed as an optimisation problem aiming at solutions that minimise, for instance, error correction costs, where costs are a measure of the confidence in the accuracy of the information acquired from DNA sequencing. Solutions have typically an exponential computational complexity.WhatsHap is a recent optimal approach which moves computational complexity from DNA fragment length to fragment overlap, i.e., coverage, and is hence of particular interest when considering sequencing technology's current trends that are producing longer fragments. Results Given the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineeredpWhatsHap, a parallel, high-performance version ofWhatsHap .pWhatsHap is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building onWhatsHap, pWhatsHap exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-coreAbstract Background Haplotype phasing is an important problem in the analysis of genomics information. Given a set of DNA fragments of an individual, it consists of determining which one of the possible alleles (alternative forms of a gene) each fragment comes from. Haplotype information is relevant to gene regulation, epigenetics, genome-wide association studies, evolutionary and population studies, and the study of mutations. Haplotyping is currently addressed as an optimisation problem aiming at solutions that minimise, for instance, error correction costs, where costs are a measure of the confidence in the accuracy of the information acquired from DNA sequencing. Solutions have typically an exponential computational complexity.WhatsHap is a recent optimal approach which moves computational complexity from DNA fragment length to fragment overlap, i.e., coverage, and is hence of particular interest when considering sequencing technology's current trends that are producing longer fragments. Results Given the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineeredpWhatsHap, a parallel, high-performance version ofWhatsHap .pWhatsHap is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building onWhatsHap, pWhatsHap exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-core architectures allows for a relevant reduction of the execution time for haplotyping, while the provided results enjoy the same high accuracy as that provided byWhatsHap, which increases with coverage. Conclusions Due to its structure and management of the large datasets, the parallelisation ofWhatsHap posed demanding technical challenges, which have been addressed exploiting a high-level parallel programming framework. The result, pWhatsHap, is a freely available toolkit that improves the efficiency of the analysis of genomics information. … (more)
- Is Part Of:
- BMC bioinformatics. Volume 17:Issue 11(2016)
- Journal:
- BMC bioinformatics
- Issue:
- Volume 17:Issue 11(2016)
- Issue Display:
- Volume 17, Issue 11 (2016)
- Year:
- 2016
- Volume:
- 17
- Issue:
- 11
- Issue Sort Value:
- 2016-0017-0011-0000
- Page Start:
- 27
- Page End:
- 41
- Publication Date:
- 2016-09
- Subjects:
- Haplotyping -- High-performance computing -- Future generation sequencing
Bioinformatics -- Periodicals
Computational biology -- Periodicals
570.285 - Journal URLs:
- http://www.biomedcentral.com/bmcbioinformatics/ ↗
http://www.pubmedcentral.nih.gov/tocrender.fcgi?journal=13 ↗
http://link.springer.com/ ↗ - DOI:
- 10.1186/s12859-016-1170-y ↗
- Languages:
- English
- ISSNs:
- 1471-2105
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - BLDSS-3PM
British Library HMNTS - Digital store
British Library HMNTS - ELD Digital store - Ingest File:
- 10044.xml