BitMapper: an efficient all-mapper based on bit-vector computing.

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Next-generation sequencing (NGS) generates massive data, posing computational challenges for mapping reads to reference genomes.
• Existing all-mappers are time-consuming, with verification being the dominant computational bottleneck.
• Efficient read mapping is crucial for analyzing large-scale genomic datasets.

Purpose of the Study:

• To develop a significantly faster and more sensitive all-mapper for next-generation sequencing data.
• To address the computational bottleneck in mapping reads, particularly the verification step.
• To provide an efficient tool for identifying all possible mapping locations of sequencing reads.

Main Methods:

• Development of BitMapper, an all-mapper utilizing a novel vectorized bit-vector algorithm.
• Simultaneous calculation of edit distances between a read and multiple genome locations.
• Implementation in C under a GPL license for broad accessibility.

Main Results:

• BitMapper demonstrates substantial speed improvements, being several times to an order of magnitude faster than existing state-of-the-art all-mappers.
• The tool achieves higher sensitivity, indicating improved accuracy in identifying mapping locations.
• Experimental validation on both simulated and real datasets confirms BitMapper's performance.

Conclusions:

• BitMapper is presented as an efficient all-mapper for next-generation sequencing reads, handling indels and mismatches.
• The tool offers a significant reduction in computational time for read mapping.
• BitMapper provides a valuable resource for genomic research, with freely available binaries.