Name
Abstract | ||
|---|---|---|
The reconstruction of the haplotype pair for each chromosome is a hot topic in Bioinformatics and Genome Analysis. In Haplotype Assembly (HA), all heterozygous Single Nucleotide Polymorphisms (SNPs) have to be assigned to exactly one of the two chromosomes. In this work, we outline the state-of-the-art on HA approaches and present an in-depth analysis of the computational performance of GenHap, a recent method based on Genetic Algorithms. GenHap was designed to tackle the computational complexity of the HA problem by means of a divide-et-impera strategy that effectively leverages multi-core architectures. In order to evaluate GenHap's performance, we generated different instances of synthetic (yet realistic) data exploiting empirical error models of four different sequencing platforms (namely, Illumina NovaSeq, Roche/454, PacBio RS II and Oxford Nanopore Technologies MinION). Our results show that the processing time generally decreases along with the read length, involving a lower number of sub-problems to be distributed on multiple cores. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-10549-5_51 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Future-generation sequencing,Genome Analysis Haplotype Assembly,High Performance Computing,Master-Slave paradigm | Genome,Minion,Supercomputer,Nanopore sequencing,Computer science,Parallel computing,Haplotype,Genetic algorithm,Computational complexity theory | Conference |
Volume | ISSN | Citations |
11339 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 15 | 9 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Tangherloni | 1 | 40 | 7.88 |
| Leonardo Rundo | 2 | 25 | 6.40 |
| Simone Spolaor | 3 | 9 | 4.97 |
| Marco S. Nobile | 4 | 143 | 23.69 |
| Ivan Merelli | 5 | 294 | 35.36 |
| Daniela Besozzi | 6 | 391 | 39.10 |
| Giancarlo Mauri | 7 | 2106 | 297.38 |
| Paolo Cazzaniga | 8 | 235 | 27.16 |
| Pietro Liò | 9 | 550 | 99.98 |