Cargando…
PWHATSHAP: efficient haplotyping for future generation sequencing
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...
Autores principales: | , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5046197/ https://www.ncbi.nlm.nih.gov/pubmed/28185544 http://dx.doi.org/10.1186/s12859-016-1170-y |
_version_ | 1782457251239297024 |
---|---|
author | Bracciali, Andrea Aldinucci, Marco Patterson, Murray Marschall, Tobias Pisanti, Nadia Merelli, Ivan Torquati, Massimo |
author_facet | Bracciali, Andrea Aldinucci, Marco Patterson, Murray Marschall, Tobias Pisanti, Nadia Merelli, Ivan Torquati, Massimo |
author_sort | Bracciali, Andrea |
collection | PubMed |
description | 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 engineered pWhatsHap, a parallel, high-performance version of WhatsHap. pWhatsHap is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on WhatsHap, 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 by WhatsHap, which increases with coverage. CONCLUSIONS: Due to its structure and management of the large datasets, the parallelisation of WhatsHap 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. |
format | Online Article Text |
id | pubmed-5046197 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-50461972016-10-11 PWHATSHAP: efficient haplotyping for future generation sequencing Bracciali, Andrea Aldinucci, Marco Patterson, Murray Marschall, Tobias Pisanti, Nadia Merelli, Ivan Torquati, Massimo BMC Bioinformatics Research 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 engineered pWhatsHap, a parallel, high-performance version of WhatsHap. pWhatsHap is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on WhatsHap, 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 by WhatsHap, which increases with coverage. CONCLUSIONS: Due to its structure and management of the large datasets, the parallelisation of WhatsHap 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. BioMed Central 2016-09-22 /pmc/articles/PMC5046197/ /pubmed/28185544 http://dx.doi.org/10.1186/s12859-016-1170-y Text en © The Author(s) 2016 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver(http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
spellingShingle | Research Bracciali, Andrea Aldinucci, Marco Patterson, Murray Marschall, Tobias Pisanti, Nadia Merelli, Ivan Torquati, Massimo PWHATSHAP: efficient haplotyping for future generation sequencing |
title | PWHATSHAP: efficient haplotyping for future generation sequencing |
title_full | PWHATSHAP: efficient haplotyping for future generation sequencing |
title_fullStr | PWHATSHAP: efficient haplotyping for future generation sequencing |
title_full_unstemmed | PWHATSHAP: efficient haplotyping for future generation sequencing |
title_short | PWHATSHAP: efficient haplotyping for future generation sequencing |
title_sort | pwhatshap: efficient haplotyping for future generation sequencing |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5046197/ https://www.ncbi.nlm.nih.gov/pubmed/28185544 http://dx.doi.org/10.1186/s12859-016-1170-y |
work_keys_str_mv | AT braccialiandrea pwhatshapefficienthaplotypingforfuturegenerationsequencing AT aldinuccimarco pwhatshapefficienthaplotypingforfuturegenerationsequencing AT pattersonmurray pwhatshapefficienthaplotypingforfuturegenerationsequencing AT marschalltobias pwhatshapefficienthaplotypingforfuturegenerationsequencing AT pisantinadia pwhatshapefficienthaplotypingforfuturegenerationsequencing AT merelliivan pwhatshapefficienthaplotypingforfuturegenerationsequencing AT torquatimassimo pwhatshapefficienthaplotypingforfuturegenerationsequencing |