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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	BMC bioinformatics Jg. 24; H. 1; S. 1 - 16
Hauptverfasser:	Lu, Zhiwen, Guo, Lu, Chen, Jianhua, Wang, Rongshu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London BioMed Central 30.09.2023 BioMed Central Ltd Springer Nature B.V BMC
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!