%0 Conference Proceedings
%T STrieGD: A Sampling Trie Indexed Compression Algorithm for Large-Scale Gene Data
%+ Institute of Computing Technology [Beijing] (ICT)
%+ University of Chinese Academy of Sciences [Beijing] (UCAS)
%A Gao, Yanzhen
%A Bao, Xiaozhen
%A Xing, Jing
%A Wei, Zheng
%A Ma, Jie
%A Zhang, Peiheng
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Network and Parallel Computing (NPC)
%C Muroran, Japan
%Y Feng Zhang
%Y Jidong Zhai
%Y Marc Snir
%Y Hai Jin
%Y Hironori Kasahara
%Y Mateo Valero
%I Springer International Publishing
%3 Network and Parallel Computing
%V LNCS-11276
%P 27-38
%8 2018-11-29
%D 2018
%R 10.1007/978-3-030-05677-3_3
%K Sampling trie
%K FASTQ file
%K Data compression
%Z Computer Science [cs]Conference papers
%X The development of next-generation sequencing (NGS) technology presents a considerable challenge for data storage. To address this challenge, a number of compression algorithms have been developed. However, currently used algorithms fail to simultaneously achieve high compression ratio as well as high compression speed. We propose an algorithm STrieGD that is based on a trie index structure for improving the compression speed of FASTQ files. To reduce the size of the trie index structure, our approach adopts a sampling strategy followed by a filtering step using quality scores. Our experiment shows that the compression ratio of our algorithm increased by approx. 50% over GZip, while being nearly equal to that of DSRC. Importantly, the compression speed of the STrieGD is 3 to 6 times faster than GZip and about 55% faster than DSRC. Moreover, with the increase of compressors, the compression ratio remains stable and the compression speed is nearly linear scalable.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-02279552/document
%2 https://inria.hal.science/hal-02279552/file/477597_1_En_3_Chapter.pdf
%L hal-02279552
%U https://inria.hal.science/hal-02279552
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-11276