Name
Abstract | ||
|---|---|---|
Small insertions and deletions (indels) of bases in the DNA of an organism can map to functionally important sites in human genes, for example, and in turn, influence human traits and diseases. Dindel detects such indels, particularly small indels (< 50 nucleotides), from short-read data by using a Bayesian approach. Due to its high sensitivity to detect small indels, Dindel has been adopted by many bioinformatics projects, e.g., the 1,000 Genomes Project, despite its pedestrian performance.In this paper, we first analyze and characterize the current version of Dindel to identify performance bottlenecks. We then design, implement, and optimize a parallelized Dindel (pDindel) for a multicore CPU architecture by exploiting thread-level parallelism (TLP) and data-level parallelism (DLP). Our optimized pDindel can achieve up to a 37-fold speedup for the computational part of Dindel and a 9-fold speedup for the overall execution time over the current version of Dindel. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICCABS.2015.7344721 | ICCABS |
Keywords | Field | DocType |
short-read mapping, indel detection, Dindel OpenMP, multithreading, vectorization | Multithreading,Architecture,Computer science,Parallel computing,Vectorization (mathematics),SIMD,Human genome,Bioinformatics,Bayesian probability,Speedup,Indel | Conference |
ISSN | Citations | PageRank |
2164-229X | 1 | 0.35 |
References | Authors | |
3 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Da Zhang | 1 | 12 | 2.25 |
| Hao Wang | 2 | 53 | 4.46 |
| Kaixi Hou | 3 | 85 | 5.85 |
| Jing Zhang | 4 | 70 | 6.53 |
| Wu-chun Feng | 5 | 2812 | 232.50 |