MinimapPool: an improved flexible and efficient parallel algorithm based on minimap2
Third-generation sequencing techniques have achieved major breakthroughs in sequencing long reads and speed. Continuous improvements in sequencing techniques have reduced sequencing costs, and the number of sequencing data files has shown explosive growth. In terms of sequence alignment, to deal with these high numbers and large-scale data, the conventional serial alignment method can no longer effectively meet the research requirements, therefore, it is of great importance to develop a faster, low-load, and compatible parallel alignment program. In this paper, we propose a parallel task pool algorithm based on the minimap2, a sequence alignment tool, and develop the task pool parallel alignment program based on this algorithm. We compare the program’s work with the average segmentation parallel alignment program. The results show that the task pool parallel alignment program has significant improvement in speedup, memory load, segmentation flexibility, and computational efficiency, it also has good scalability and computational stability. MinimapPool is available at https://github.com/krkrcc/MinimapPool.
Authors
- Yingbo Cui (ORCID: https://orcid.org/0000-0003-4000-4957)
- Jiandong Shang (ORCID: https://orcid.org/0009-0001-7673-2641)
- Boya Ji (ORCID: https://orcid.org/0000-0001-8458-1751)
- Zhi Wang (ORCID: https://orcid.org/0000-0002-8207-776X)
- Jianan Li (ORCID: https://orcid.org/0000-0002-6936-9485)
- Shaoliang Peng (ORCID: https://orcid.org/0000-0002-4647-2615)
Institutions
- Hunan University (CN)
- National University of Defense Technology (CN)
- Zhengzhou University (CN)
Publication Details
- Published
- 2024-12-03
- DOI
- https://doi.org/10.1109/bibm62325.2024.10822839
- Citations
- 1
- Primary Topic
- Parallel Computing and Optimization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.49
Funders
- National Natural Science Foundation of China
- National University of Defense Technology