Differential direct coding: A compression algorithm for nucleotide sequence data

Database

Volumn 2009, Issue , 2009, Pages

  Vey, Gregory ^a  

^a WILFRID LAURIER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84890458860     PISSN: 17580463     EISSN: None     Source Type: Journal    
DOI: 10.1093/database/bap013     Document Type: Article

References (21)

1. Galperin, M.Y. and Cochrane, G.R. (2009) Nucleic Acids Research annual Database Issue and the NAR online Molecular Biology Database Collection in 2009. Nucleic Acids Res., 37, D1-D4.
2. Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J. et al. (2008) GenBank. Nucleic Acids Res., 36, D25-D30.
3. Hoebeke, M., Chiapello, H., Gibrat, J.F. et al. (2005) Annotation and databases: status and prospects. In Lesk, A.M. (ed), Database Annotation in Molecular Biology, John Wiley & Sons, West Sussex, England, pp. pp. 1-21.
4. Williams, H.E. and Zobel, J. (1996) Practical compression of nucleotide databases. Proceedings of Australasian Computer Science Conference, Computer Science Association, University of Melbourne, Melbourne, Victoria, Australia, pp. 184-193.
5. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, 23, 337-342.
6. Ziv, J. and Lempel, A. (1978) Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, 24, 530-536.
7. Salomon, D.A. (2008) Concise Introduction to Data Compression. Springer, London.
8. Huffman, D.A. (1952) A method for the construction of minimumredundancy codes. Proc. IRE, 40, 1098-1101.
9. Behzadi, B. and LeFessant, F. (2005) DNA compression challenge revisited. Symposium on Combinatorial Pattern Matching (CPM'2005), Jeju Island, Korea, Springer, Berlin/Heidelberg, pp. 190-200.
10. Grumbach, S. and Tahi, F. (1993) Compression of DNA sequences. Proceedings of IEEE Symposium on Data Compression, CA, USA, IEEE Computer Society Press, Los Alamitos, pp. 340-350.
11. Grumbach, S. and Tahi, F. (1994) A new challenge for compression algorithms: genetic sequences. J. Info. Process. Manag., 30, 875-866.
12. Milosavljević, A. (1993) Discovering sequence similarity by the algorithmic significance method. Proc. Int. Conf. Intell. Syst. Mol. Biol., 1, 284-291.
13. Rivals, E., Dauchet, M., Delahaye, J.P. et al. (1996) Compression and genetic sequence analysis. Biochimie, 78, 315-322.
14. Cherniavski, N. and Lander, R. (2004) Grammar-based compression of DNA sequences. Computer Science & Engineering Technical Report. University of Washington, 2007-05-02, pp. 1-21.
15. Liu, Q., Yang, Y., Chen, C. et al. (2008) RNACompress: grammar-based compression and informational complexity measurement of RNA secondary structure. BMC Bioinformatics, 9, 176.
16. Chen, X., Kwong, S. and Li, M. (2001) A compression algorithm for DNA sequences. IEEE Eng. Med. Biol. Mag., 20, 61-66.
17. Chen, X., Li, M., Ma, B. et al. (2002) DNACompress: fast and effective DNA sequence compression. Bioinformatics, 18, 1696-1698.
18. Bonanno, C., Galatolo, S. and Menconi, G. (2002) Information of sequences and applications. Physica A, 305, 196-199.
19. Menconi, G. (2005) Sublinear growth of information in DNA sequences. Bulletin Math. Biol., 67, 737-759.
20. Menconi, G., Benci, V. and Buiatti, M. (2008) Data compression and genomes: a two dimensional life domain map. J. Theoret. Biol., 253, 281-288.
21. Venter, J.C., Remington, K., Heidelberg, J.F. et al. (2004) Environmental genome shotgun sequencing of the Sargasso Sea. Science, 304, 66-74.