A Two-Level Scheme for Quality Score Compression

Voges J., Fotouhi A., Ostermann J., Külekci M. O.

JOURNAL OF COMPUTATIONAL BIOLOGY, vol.25, no.10, pp.1141-1151, 2018 (SCI-Expanded) identifier identifier identifier

  • Publication Type: Article / Article
  • Volume: 25 Issue: 10
  • Publication Date: 2018
  • Doi Number: 10.1089/cmb.2018.0065
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1141-1151
  • Istanbul Technical University Affiliated: Yes


Previous studies on quality score compression can be classified into two main lines: lossy schemes and lossless schemes. Lossy schemes enable a better management of computational resources. Thus, in practice, and for preliminary analyses, bioinformaticians may prefer to work with a lossy quality score representation. However, the original quality scores might be required for a deeper analysis of the data. Hence, it might be necessary to keep them; in addition to lossy compression this requires lossless compression as well. We developed a space-efficient hierarchical representation of quality scores, QScomp, which allows the users to work with lossy quality scores in routine analysis, without sacrificing the capability of reaching the original quality scores when further investigations are required. Each quality score is represented by a tuple through a novel decomposition. The first and second dimensions of these tuples are separately compressed such that the first-level compression is a lossy scheme. The compressed information of the second dimension allows the users to extract the original quality scores. Experiments on real data reveal that the downstream analysis with the lossy part-spending only 0.49 bits per quality score on average-shows a competitive performance, and that the total space usage with the inclusion of the compressed second dimension is comparable to the performance of competing lossless schemes.