Reference-based genome compression using the longest matched substrings with parallelization consideration.

ABSTRACT:

Background

A large number of researchers have devoted to accelerating the speed of genome sequencing and reducing the cost of genome sequencing for decades, and they have made great strides in both areas, making it easier for researchers to study and analyze genome data. However, how to efficiently store and transmit the vast amount of genome data generated by high-throughput sequencing technologies has become a challenge for data compression researchers. Therefore, the research of genome data compression algorithms to facilitate the efficient representation of genome data has gradually attracted the attention of these researchers. Meanwhile, considering that the current computing devices have multiple cores, how to make full use of the advantages of the computing devices and impro

SUBMITTER: Lu Z 

PROVIDER: S-EPMC10544193 | biostudies-literature | 2023 Sep

REPOSITORIES: biostudies-literature