Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/23156
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bracciali, Andrea | en_UK |
dc.contributor.author | Aldinucci, Marco | en_UK |
dc.contributor.author | Patterson, Murray | en_UK |
dc.contributor.author | Marschall, Tobias | en_UK |
dc.contributor.author | Pisanti, Nadia | en_UK |
dc.contributor.author | Merelli, Ivan | en_UK |
dc.contributor.author | Torquati, Massimo | en_UK |
dc.contributor.editor | Nonis, A | en_UK |
dc.contributor.editor | Di Serio, C | en_UK |
dc.contributor.editor | Lio', P | en_UK |
dc.contributor.editor | Tagliaferri, R | en_UK |
dc.contributor.editor | Rizzo, R | en_UK |
dc.date.accessioned | 2017-10-25T23:35:17Z | - |
dc.date.available | 2017-10-25T23:35:17Z | - |
dc.date.issued | 2016-09-22 | en_UK |
dc.identifier.uri | http://hdl.handle.net/1893/23156 | - |
dc.description.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 con dence 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 ecient 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 le 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 eciency of the analysis of genomics information. | en_UK |
dc.language.iso | en | en_UK |
dc.publisher | BioMed Central | en_UK |
dc.relation | Bracciali A, Aldinucci M, Patterson M, Marschall T, Pisanti N, Merelli I & Torquati M (2016) PWHATSHAP: efficient haplotyping for future generation sequencing. Nonis A (Editor), Di Serio C (Editor), Lio' P (Editor), Tagliaferri R (Editor) & Rizzo R (Editor) 11th International Meeting on Computational Intelligence Methods for Bioinformatics and Biostatistics (CIBB 2014), Cambridge, UK, 26.06.2014-28.06.2014. BMC Bioinformatics, 17 (Supplement 11). http://www.cussb.unisr.it/cibb2014/; https://doi.org/10.1186/s12859-016-1170-y | en_UK |
dc.rights | © The Author(s) 2016 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. | en_UK |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en_UK |
dc.subject | Haplotyping | en_UK |
dc.subject | High-performance computing | en_UK |
dc.subject | Future generation sequencing | en_UK |
dc.title | PWHATSHAP: efficient haplotyping for future generation sequencing | en_UK |
dc.type | Conference Paper | en_UK |
dc.identifier.doi | 10.1186/s12859-016-1170-y | en_UK |
dc.identifier.pmid | 28185544 | en_UK |
dc.citation.jtitle | BMC Bioinformatics | en_UK |
dc.citation.issn | 1471-2105 | en_UK |
dc.citation.volume | 17 | en_UK |
dc.citation.issue | Supplement 11 | en_UK |
dc.citation.publicationstatus | Published | en_UK |
dc.citation.peerreviewed | Refereed | en_UK |
dc.type.status | VoR - Version of Record | en_UK |
dc.identifier.url | http://www.cussb.unisr.it/cibb2014/ | en_UK |
dc.author.email | abb@cs.stir.ac.uk | en_UK |
dc.citation.conferencedates | 2014-06-26 - 2014-06-28 | en_UK |
dc.citation.conferencelocation | Cambridge, UK | en_UK |
dc.citation.conferencename | 11th International Meeting on Computational Intelligence Methods for Bioinformatics and Biostatistics (CIBB 2014) | en_UK |
dc.citation.date | 22/09/2016 | en_UK |
dc.contributor.affiliation | Computing Science | en_UK |
dc.contributor.affiliation | University of Turin | en_UK |
dc.contributor.affiliation | Claude Bernard University Lyon 1 | en_UK |
dc.contributor.affiliation | Saarland University | en_UK |
dc.contributor.affiliation | University of Pisa | en_UK |
dc.contributor.affiliation | Italian National Research Council (CNR) | en_UK |
dc.contributor.affiliation | University of Pisa | en_UK |
dc.identifier.isi | WOS:000392421500004 | en_UK |
dc.identifier.scopusid | 2-s2.0-84994476655 | en_UK |
dc.identifier.wtid | 572073 | en_UK |
dc.contributor.orcid | 0000-0003-1451-9260 | en_UK |
dc.date.accepted | 2016-04-12 | en_UK |
dcterms.dateAccepted | 2016-04-12 | en_UK |
dc.date.filedepositdate | 2016-05-03 | en_UK |
rioxxterms.apc | not required | en_UK |
rioxxterms.type | Conference Paper/Proceeding/Abstract | en_UK |
rioxxterms.version | VoR | en_UK |
local.rioxx.author | Bracciali, Andrea|0000-0003-1451-9260 | en_UK |
local.rioxx.author | Aldinucci, Marco| | en_UK |
local.rioxx.author | Patterson, Murray| | en_UK |
local.rioxx.author | Marschall, Tobias| | en_UK |
local.rioxx.author | Pisanti, Nadia| | en_UK |
local.rioxx.author | Merelli, Ivan| | en_UK |
local.rioxx.author | Torquati, Massimo| | en_UK |
local.rioxx.project | Internal Project|University of Stirling|https://isni.org/isni/0000000122484331 | en_UK |
local.rioxx.contributor | Nonis, A| | en_UK |
local.rioxx.contributor | Di Serio, C| | en_UK |
local.rioxx.contributor | Lio', P| | en_UK |
local.rioxx.contributor | Tagliaferri, R| | en_UK |
local.rioxx.contributor | Rizzo, R| | en_UK |
local.rioxx.freetoreaddate | 2016-09-22 | en_UK |
local.rioxx.licence | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved||2016-09-22 | en_UK |
local.rioxx.licence | http://creativecommons.org/licenses/by/4.0/|2016-09-22| | en_UK |
local.rioxx.filename | Bracciali-etal-BMCBioinformatics-2016.pdf | en_UK |
local.rioxx.filecount | 1 | en_UK |
Appears in Collections: | Computing Science and Mathematics Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Bracciali-etal-BMCBioinformatics-2016.pdf | Fulltext - Published Version | 1.17 MB | Adobe PDF | View/Open |
This item is protected by original copyright |
A file in this item is licensed under a Creative Commons License
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.