TY  - COMP
TI  - Distributed Berkeley Efficient Long-Read to Long-Read Aligner and Overlapper (DiBELLA) v1.0.0
AB  - We present a parallel algorithm and scalable implementation for genome analysis, specifically the problem of finding overlaps and alignments for data from "third generation" long read sequencers. While long sequences of DNA offer enormous advantages for biological analysis and insight, current long read sequencing instruments have high error rates and therefore require different approaches to analysis than their short read counterparts. Our work focuses on an efficient distributed-memory parallelization of an accurate single-node algorithm for overlapping and aligning long reads. We achieve scalability of this irregular algorithm by addressing the competing issues of increasing parallelism, minimizing communication, constraining the memory footprint, and ensuring good load balance. The resulting application, DiBELLA, is the first distributed memory overlapper and aligner specifically designed for long reads and parallel scalability.
AU  - Ellis, Marquita
DO  - https://doi.org/10.11578/dc.20210316.1
UR  - https://www.osti.gov/doecode/biblio/52870
CY  - United States
PY  - 2020
DA  - 2020-10-22
LA  - English
C1  - Research Org.: Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
C2  - Sponsor Org.: USDOE; Oak Ridge National Laboratory
C4  - Contract Number: AC02-05CH11231; C4  - Contract Number: AWD1896
ER  -