|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||High-Performance Haplotype Assembly|
|Citation:||Aldinucci M, Bracciali A, Marschall T, Patterson M, Pisanti N & Torquati M (2015) High-Performance Haplotype Assembly. In: Serio C, Lio P, Nonis A & Tagliaferri R (eds.) Computational Intelligence Methods for Bioinformatics and Biostatistics: 11th International Meeting, CIBB 2014, Cambridge, UK, June 26-28, 2014, Revised Selected Papers. Lecture Notes in Computer Science, 8623. 11th International Meeting, CIBB 2014, Cambridge, 26.06.2014-28.06.2014. Cham, Switzerland: Springer, pp. 245-258. https://doi.org/10.1007/978-3-319-24462-4_21|
|Series/Report no.:||Lecture Notes in Computer Science, 8623|
|Conference Name:||11th International Meeting, CIBB 2014|
|Conference Dates:||2014-06-26 - 2014-06-28|
|Abstract:||The problem ofHaplotype Assemblyis an essential step in human genome analysis. It is typically formalised as theMinimum Error Correction(MEC) problem which is NP-hard. MEC has been approached using heuristics, integer linear programming, and fixed-parameter tractability (FPT), including approaches whose runtime is exponential in the length of the DNA fragments obtained by the sequencing process. Technological improvements are currently increasing fragment length, which drastically elevates computational costs for such methods. We presentpWhatsHap, a multi-core parallelisation ofWhatsHap, a recent FPT optimal approach to MEC.WhatsHapmoves complexity from fragment length to fragment overlap and is hence of particular interest when considering sequencing technology’s current trends.pWhatsHapfurther improves the efficiency in solving the MEC problem, as shown by experiments performed on datasets with high coverage.|
|Status:||VoR - Version of Record|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|chp3A10.10072F978-3-319-24462-4_21.pdf||Fulltext - Published Version||574.72 kB||Adobe PDF||Under Embargo until 2999-05-31 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
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 firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.