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

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...

Full description

Saved in:

Bibliographic Details
Published in:	BMC bioinformatics Vol. 24; no. 1; pp. 1 - 16
Main Authors:	Lu, Zhiwen, Guo, Lu, Chen, Jianhua, Wang, Rongshu
Format:	Journal Article
Language:	English
Published:	London BioMed Central 30.09.2023 BioMed Central Ltd Springer Nature B.V BMC
Subjects:	Algorithms Arrays Bioinformatics Biomedical and Life Sciences Compression Compression ratio Computation Computational Biology/Bioinformatics Computer Appl. in Life Sciences CUDA Data compression Dictionaries DNA sequencing Gene sequencing Genetic research Genome compression Genomes Genomics Life Sciences Methods Microarrays Multiprocessing Next-generation sequencing Nucleotide sequence Nucleotide sequencing Parallel processing Parallelization Reference-based Suffix array Whole genome sequencing China CUDA Reference-based Suffix array Parallelization Genome compression
ISSN:	1471-2105, 1471-2105
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!