bioRxivBioinformaticsPreprint
LISA: A Case For Learned Index based Acceleration of Biological Sequence Analysis
Darryl Ho, Saurabh Kalikar, Sanchit MisraiD, Jialin DingiD, Vasimuddin MdiD, Nesime TatbuliD, Heng LiiD, Tim KraskaiD
Abstract
Next Generation Sequencing (NGS) is transforming fields like genomics, transcriptomics, and epigenetics with rapidly increasing throughput at reduced cost. This also demands overcoming performance bottlenecks in the downstream analysis of the sequencing data. A key performance bottleneck is searching for exact matches of entire or substrings of short DNA/RNA sequence queries in a long reference sequence database. This task is typically performed by using an index of the reference - such as FM-index, suffix arrays, suffix trees, hash tables, or lookup tables. In this paper, we propose accelerating this sequence search by substituting or enhancing the indexes with machine learning based indexes - called learned indexes - and present LISA (Learned Indexes for Sequence Analysis). We evaluate LISA through a number of case studies - that cover widely used software tools; short and long reads; human, animal, and plant genome datasets; DNA and RNA sequences; various traditional indexing techniques (FM-indexes, hash tables and suffix arrays) - and demonstrate significant performance benefits in a majority of them. For example, our experiments on real datasets show that LISA achieves speedups of up to 2.2 fold and 4.7 fold over the state-of-the-art FM-index based implementations for exact sequence search modules in popular tools bowtie2 and BWA-MEM2, respectively. Code availabilityLISA-based FM-index: https://github.com/IntelLabs/Trans-Omics-Acceleration-Library/tree/master/src/LISA-FMI LISA-based hash-table: https://github.com/IntelLabs/Trans-Omics-Acceleration-Library/tree/master/src/LISA-hash LISA applied to BWA-MEM2: https://github.com/bwa-mem2/bwa-mem2/tree/bwa-mem2-lisa.
- organism: human
- organism: plant (other)
- assay: DNA methylation
- assay: whole-genome sequencing
- assay: whole-exome sequencing
- assay: long-read sequencing
- research focus: variant calling
- research focus: benchmarking
- approach: machine learning (classical)
- Citations
- 6
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- An Incrementally Updatable and Scalable System for Large-Scale Sequence Search using LSM Trees
Fatemeh Almodaresi, Jamshed Khan, … Rob Patro·bioRxiv·Feb 5, 2021
- BWA-MEME: BWA-MEM emulated with a machine learning approach
Youngmok Jung, Dongsu Han·BioinformaticsPeer-reviewed·Mar 3, 2022
- Mantis: A Fast, Small, and Exact Large-Scale Sequence Search Index
Prashant Pandey, Fatemeh Almodaresi, … Rob Patro·Cell SystemsPeer-reviewed·Jun 21, 2018
- An optimized FM-index library for nucleotide and amino acid search
Tim Anderson, Travis J. Wheeler·Algorithms for Molecular BiologyPeer-reviewed·Dec 1, 2021
- BURST enables mathematically optimal short-read alignment for big data
Gabriel A. Al‐Ghalith, Dan Knights·bioRxiv·Sep 8, 2020
- nsearch: An open source C++ library for processing and similarity searching of next-generation sequencing data
Schmid Steven, Timothy Ryan Julian, Manu V. Tamminen·bioRxiv·Aug 25, 2018