Trends in genome compression

Current Bioinformatics

Volumn 9, Issue 3, 2014, Pages 315-326

  Wandelt, Sebastian ^a   Bux, Marc ^a   Leser, Ulf ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Genome compression; Read compression; Survey

Indexed keywords

ARTICLE; COST; DATA PROCESSING; GENE SEQUENCE; GENOME; HIGH THROUGHPUT SEQUENCING; HUMAN GENOME; PRIORITY JOURNAL; ALGORITHM; BOOK; COMPRESSION; REFERENCE DATABASE; SINGLE NUCLEOTIDE POLYMORPHISM; STATISTICAL CONCEPTS;

COST BENEFIT ANALYSIS; GENES;

DATA SET; GENOME COMPRESSION; GENOME SEQUENCING; GENOMIC DATA; HIGH-THROUGHPUT SEQUENCING; HUMAN GENOMES; READ COMPRESSION; SEQUENCE COMPRESSION; SHEER SIZE; TECHNOLOGICAL ADVANCEMENT;

HARD DISK STORAGE;

EID: 84904764719     PISSN: 15748936     EISSN: None     Source Type: Journal    
DOI: 10.2174/1574893609666140516010143     Document Type: Article

References (71)

1. Kahn SD. On the future of genomic data. Science 2011; 331(6018): 728-729.
2. Via M, Gignoux C, Burchard EG. The 1000 Genomes Project: new opportunities for research and social challenges. Genome Med 2010; 2(1): 3. doi: 10. 1186/gm124.
3. Hudson TJ, Anderson W, Artez A, et al. International network of cancer genome projects. Nature 2010; 464(7291): 993-998.
4. Trelles O, Prins P, Snir M, et al. Big data, but are we ready? Nat Rev Genet 2011; 12(3): 224.
5. Schadt EE, Turner S, Kasarskis A. A window into third-generation sequencing. Human Mol Genet 2010, 19(R2): R227-R240.
6. Stein L. The case for cloud computing in genome informatics. Genome Biol 2010, 11(5): 207.
7. Wandelt S, Rheinländer A, Bux M, Thalheim L, Haldemann B, Leser U. Data management challenges in next generation sequencing. Datenbank-Spektrum 2012, 12(3): 161-171.
8. Grumbach S, Tahi F. A new challenge for compression algorithms: genetic sequences. Inform Process Manag 1994, 30(6): 875-886.
9. Chen L, Lu S, Ram J. Compressed pattern matching in dna sequences. In Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, CSB'04, pages 62-68.
10. Larsson J, Moffat A. Offline dictionary-based compression. In Proceedings of the 1999 Conference on Data Compression, DCC'99, pages 296-305.
11. Shibata Y, Matsumoto T, Takeda M, et al. A boyer-moore type algorithm for compressed pattern matching. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching 2000, COM'00, pages 181-194.
12. Cleary JG, Witten IH. Data compression using adaptive coding and partial string matching. IEEE T Comm 1984, 32: 396-402.
13. Cao MD, Dix TI, Allison L, Mears C. A simple statistical algorithm for biological sequence compression. In Proceedings of the 2007 Conference on Data Compression, DCC'07, pages 43-52.
14. Pennebaker WB, L. Mitchell J. JPEG Still Image Data Compression Standard. Van Nostrand Reinhold, New York, USA, 1992.
15. Nevill-Manning CG, Witten IH. Protein is incompressible. In Proceedings of the 1999 Conference on Data Compression, DCC'99, page 257.
16. Hategan A, Tabus I. Protein is compressible. In Proceedings of the 6th Nordic Signal Processing Symposium, NORSIG 2004, pages 192-195.
17. Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE T Inform Theory 1977, 23(3): 337-343.
18. Golomb SW. Run-length encodings. IEEE T Inform Theory 1966, 12: 399-401.
19. Klein ST, Ben-Nissan MK. On the usefulness of fibonacci compression codes. Computer J 2010, 53(6): 701-716.
20. Huffman DA. A method for the construction of minimumredundancy codes. Proceedings of the Institute of Radio Engineers 1952, 40(9): 1098-1101.
21. Bookstein A, Klein ST. Is huffman coding dead? Computing 1993, 50: 279-296.
22. Matsumoto T, Sadakane K, Hiroshi I, et al. Currents in Computational Molecular Biology 2000, pages 76-77. Universal Academy Press Inc.
23. Moffat A, Neal R, Witten I. Arithmetic coding revisited. In Proceedings of the 1995 Conference on Data Compression, DCC'95, pages 202-294.
24. Cormack G, Horspool N. Data compression using dynamic markov modelling. Comput J 1987, 30: 541-550.
25. Schatz M, Langmead N, Salzberg S. Cloud computing and the dna data race. Nature Biotechnology 2010, 28(7): 691.
26. Deorowicz S, Grabowski S. Compression of dna sequence reads in fastq format. Bioinformatics 2011, 27(6): 860-862.
27. Chin L, Andersen JN, Futreal PA. Cancer genomics: from discovery science to personalized medicine. Nat Med 2011, 17(3): 297-303.
28. Wandelt S, Leser U. Adaptive efficient compression of genomes. Algorithm Mol Bio 2012, 7: 30.
29. Wandelt S and Leser U. FRESCO: Referential Compression of Highly-Similar sequences. IEEE ACM T Comput Bi 2013, (to appear).
30. Schloss P, Handelsman J. Biotechnological prospects from metagenomics. Curr Opin Biotechn 2003, 14(3): 303-310.
31. Vey G. Differential direct coding: a compression algorithm for nucleotide sequence data. The Journal of Biological Databases and Curation 2009.
32. Rajeswari PR, Apparo A, Kumar VK. Genbit compress tool(gbc): A java-based tool to compress dna sequences and compute compression ratio(bits/base) of genomes. CoRR, abs/1006. 1193, 2010.
33. Bharti RK, Verma A, Singh RK. A biological sequence compression based on cross chromosomal similarities using variable length lut. Intl J Biomet Bioinform 2011, 4: 217-223.
34. Mehta A, Patel B. Dna compression using hash based data structure. Intl J Inform Technol & Knowl Manage 2010, 3: 383-386.
35. Lin P, Liu S, Zhang L, et al. Compressed pattern matching in dna sequences using multithreaded technology. In 3rd International Conference on Bioinformatics and Biomedical Engineering, ICBBE'09.
36. Mishra KN, Aaggarwal A, Abdelhadi E, et al. An efficient horizontal and vertical method for online dna sequence compression. Intl J Comput Appl 2010, 3(1): 39-46.
37. Rajeswari P, Apparao A. Dnabit compress-genome compression algorithm. Bioinformation 2011, 5(8): 350-60.
38. Kuruppu S, Beresford-Smith B, Conway T, et al. Iterative dictionary construction for compression of large dna data sets. IEEE ACM T Comput Bi 2012, 9(1): 137-149.
39. Antoniou D, Theodoridis E, Tsakalidis A. Compressing biological sequences using self adjusting data structures. In Information Technology and Applications in Biomedicine 2010.
40. Kaipa KK, Bopardikar AS, Abhilash S, et al. Algorithm for dna sequence compression based on prediction of mismatch bases and repeat location. In Bioinformatics and Biomedicine Workshops, BIBMW 2010.
41. Cao MD, Dix TI, Allison L, et al. A simple statistical algorithm for biological sequence compression. In Proceedings of the 2007 Conference on Data Compression, DCC'07, pages 43-52.
42. Pratas D, Pinho AJ. Compressing the human genome using exclusively markov models. Adv Intel Soft Comput 2011; 213-220.
43. Venugopal KR, Srinivasa KG, Patnaik L. Probabilistic Approach for DNA Compression, chapter 14, pages 279-289. Springer, 2009.
44. Tabus I, Korodi G. Genome compression using normalized maximum likelihood models for constrained markov sources. In Information Theory Workshop, 2008.
45. Kaipa KK, Lee K, Ahn T, et al. System for random access dna sequence compression. In International Conference on Bioinformatics and Biomedicine Workshops, 2010.
46. Brandon MC, Wallace DC, Baldi P. Data structures and compression algorithms for genomic sequence data. Bioinformatics 2009, 25(14): 1731-1738.
47. Christley S, Lu Y, Li C, et al. Human genomes as email attachments. Bioinformatics 2009, 25(2): 274-275.
48. Wang C, Zhang D. A novel compression tool for efficient storage of genome resequencing data. Nucleic Acids Res 2011, 39(7): e45.
49. Kuruppu S, Puglisi SJ, Zobel J. Relative lempel-ziv compression of genomes for large-scale storage and retrieval. In Proceedings of the 17th International Conference on String Processing and Information Retrieval, SPIRE'10, pages 201-206.
50. Kuruppu S, Puglisi S, Zobel J. Optimized relative lempel-ziv compression of genomes. In Australasian Computer Science Conference 2011.
51. Grabowski S, Deorowicz S. Engineering relative compression of genomes. CoRR, abs/1103. 2351, 2011.
52. Pinho AJ, Pratas D, Garcia SP. Green: a tool for efficient compression of genome resequencing data. Nucleic Acids Res 2011.
53. Kim JD, Kim JH. Dna data compression based on the whole genome sequence. J Convergence Inform Technol 2009, 4(3): 82-85.
54. Kreft S, Navarro G. Lz77-like compression with fast random access. In Proceedings of the 2010 Conference on Data Compression, DCC'10, pages 239-248.
55. Peel A, Wirth A, Zobel J. Collection-based compression using discovered long matching strings. In Proceedings of the 20th ACM International Conference on Information and Knowledge Management, CIKM'11, pages 2361-236.
56. Pande P, Matani D. Compressing the human genome against a reference. Technical report, Stony Brook University, 2011.
57. Afify H, Islam M, Wahed MA. Dna lossless differential compression algorithm based on similarity of genomic sequence database. CoRR, abs/1109. 0094, 2011.
58. Afify H, Islam M, Wahed MA. Genomic sequences differential compression model. Intl J Comput Sci Inform Technol 2011, 3: 145-154.
59. Kuruppu S, Puglisi S, Zobel J. Reference sequence construction for relative compression of genomes. In Proceedings of the 18th International Conference on String Processing and Information Retrieval, SPIRE'11, pages 420-425.
60. BrockmanW, AlvarezP, Young S, et al. Quality scores and SNP detection in sequencing-by-synthesis systems. Genome Res 2008, 18(5): 763-770.
61. Herrera P, Kuri-Morales A. Lossless compression of biological sequences with evolutionary metadictionaries. In Workshop on Machine Learning and Data Mining 2009.
62. Menconi G, Benci V, Buiatti M. Data compression and genomes: a two-dimensional life domain map. J Theor Biol 2008, 253(2): 281-288.
63. Zhu Z, Zhou J, Ji Z, et al. Dna sequence compression using adaptive particle swarm optimization-based memetic algorithm. IEEE T Evolut Comput 2011, 15(5): 643-658.
64. Bhola V, Bopardikar A, Narayanan R, et al. No-reference compression of genomic data stored in fastq format. In Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine, BIBM'11, pages 147-150.
65. Wan R, Anh VN, Asai K. Transformations for the compression of fastq quality scores of next generation sequencing data. Bioinformatics 2011.
66. Tembe W, Lowey J, SuhE. G-sqz: compact encoding of genomic sequence and quality data. Bioinformatics 2010, 26(17): 2192-2194.
67. Chen WH, Lu YW, Lai FP, et al. Integrating human genome database into electronic health record with sequence alignment and compression mechanism. J Med Syst 2011, 36(3): 2587-2597.
68. Daily K, Rigor R, Christley S, et al. Data structures and compression algorithms for high throughput sequencing technologies. BMC Bioinformatics 2010, 11(1): 514+.
69. Kozanitis C, Saunders C, Kruglyak S, et al. Compressing genomic sequence fragments using slimgene. In Proceedings of the 14th Annual International Conference on Research in Computational Molecular Biology, RECOMB'10, pages 310-324.
70. Fritz MH, Leinonen R, Cochrane G, et al. Efficient storage of high throughput dna sequencing data using reference-based compression. Genome Res 2011, 21(5): 734-740.
71. Wandelt S, Starlinger J, Bux M, et al. RCSI: Scalable similarity search in thousand(s) of genomes. In Proceedings of the VLDB Endowment 2013 (PVLDB), Vol. 6, No 13.