Please use this identifier to cite or link to this item:
|Title:||SRComp : short read sequence compression using burstsort and Elias omega coding||Authors:||Selva, Jeremy John
|Keywords:||DRNTU::Science::Physics||Issue Date:||2013||Source:||Selva, J. J., & Chen, X. (2013). SRComp : short read sequence compression using burstsort and Elias omega coding. PLoS ONE, 8(12), e81414-.||Series/Report no.:||PLoS ONE||Abstract:||Next-generation sequencing (NGS) technologies permit the rapid production of vast amounts of data at low cost. Economical data storage and transmission hence becomes an increasingly important challenge for NGS experiments. In this paper, we introduce a new non-reference based read sequence compression tool called SRComp. It works by first employing a fast string-sorting algorithm called burstsort to sort read sequences in lexicographical order and then Elias omega-based integer coding to encode the sorted read sequences. SRComp has been benchmarked on four large NGS datasets, where experimental results show that it can run 5-35 times faster than current state-of-the-art read sequence compression tools such as BEETL and SCALCE, while retaining comparable compression efficiency for large collections of short read sequences. SRComp is a read sequence compression tool that is particularly valuable in certain applications where compression time is of major concern.||URI:||https://hdl.handle.net/10356/99194
|ISSN:||1932-6203||DOI:||10.1371/journal.pone.0081414||Rights:||© 2013 Selva, Chen. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Files in This Item:
|SRComp Short Read Sequence Compression Using Burstsort and Elias Omega Coding.pdf||358.18 kB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.