메뉴 건너뛰기




Volumn 40, Issue 4, 2012, Pages

GReEn: A tool for efficient compression of genome resequencing data

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CODING; GENE SEQUENCE; INFORMATION PROCESSING; INTERMETHOD COMPARISON; PRIORITY JOURNAL; STATISTICAL ANALYSIS;

EID: 84857860662     PISSN: 03051048     EISSN: 13624962     Source Type: Journal    
DOI: 10.1093/nar/gkr1124     Document Type: Article
Times cited : (82)

References (37)
  • 2
    • 0000100455 scopus 로고
    • A new challenge for compression algorithms: Genetic sequences
    • DOI 10.1016/0306-4573(94)90014-0
    • Grumbach, S. and Tahi, F. (1994) A new challenge for compression algorithms: genetic sequences. Inform. Process. Manag., 30, 875-886. (Pubitemid 124012808)
    • (1994) Information Processing and Management , vol.30 , Issue.6 , pp. 875-886
    • Grumbach, S.1
  • 4
  • 5
    • 0001941057 scopus 로고    scopus 로고
    • A compression algorithm for DNA sequences and its applications in genome comparison
    • Asai, K., Miyano, S. and Takagi, T. (eds) Universal Academy Press, Inc, Tokyo, Japan
    • Chen, X., Kwong, S. and Li, M. (1999) A compression algorithm for DNA sequences and its applications in genome comparison. In Asai, K., Miyano, S. and Takagi, T. (eds), Genome Informatics 1999: Proc. of the 10th Workshop. Universal Academy Press, Inc, Tokyo, Japan, pp. 51-61.
    • (1999) Genome Informatics 1999: Proc. of the 10th Workshop , pp. 51-61
    • Chen, X.1    Kwong, S.2    Li, M.3
  • 6
    • 0034578442 scopus 로고    scopus 로고
    • Biological sequence compression algorithms
    • Dunker, A. K., Konagaya, A., Miyano, S. and Takagi, T. (eds) Tokyo, Japan
    • Matsumoto, T., Sadakane, K. and Imai, H. (2000) Biological sequence compression algorithms. In Dunker, A. K., Konagaya, A., Miyano, S. and Takagi, T. (eds), Genome Informatics 2000: Proceedings of the 11th Workshop. Tokyo, Japan, pp. 43-52.
    • (2000) Genome Informatics 2000: Proceedings of the 11th Workshop , pp. 43-52
    • Matsumoto, T.1    Sadakane, K.2    Imai, H.3
  • 7
    • 0034890615 scopus 로고    scopus 로고
    • A compression algorithm for DNA sequences
    • Chen, X., Kwong, S. and Li, M. (2001) A compression algorithm for DNA sequences. IEEE Eng. Med. Biol. Mag., 20, 61-66.
    • (2001) IEEE Eng. Med. Biol. Mag. , vol.20 , pp. 61-66
    • Chen, X.1    Kwong, S.2    Li, M.3
  • 8
    • 0036947893 scopus 로고    scopus 로고
    • DNACompress: Fast and effective DNA sequence compression
    • DOI 10.1093/bioinformatics/18.12.1696
    • Chen, X., Li, M., Ma, B. and Tromp, J. (2002) DNACompress: fast and effective DNA sequence compression. Bioinformatics, 18, 1696-1698. (Pubitemid 36097740)
    • (2002) Bioinformatics , vol.18 , Issue.12 , pp. 1696-1698
    • Chen, X.1    Li, M.2    Ma, B.3    Tromp, J.4
  • 9
    • 34547630306 scopus 로고    scopus 로고
    • DNA sequence compression using the normalized maximum likelihood model for discrete regression
    • Snowbird. Utah
    • Tabus, I., Korodi, G. and Rissanen, J. (2003) DNA sequence compression using the normalized maximum likelihood model for discrete regression. In Proceedings of the Data Compression Conference, DCC-2003. Snowbird. Utah, pp. 253-262.
    • (2003) Proceedings of the Data Compression Conference, DCC-2003 , pp. 253-262
    • Tabus, I.1    Korodi, G.2    Rissanen, J.3
  • 10
    • 8344261403 scopus 로고    scopus 로고
    • A simple and fast DNA compressor
    • Manzini, G. and Rastero, M. (2004) A simple and fast DNA compressor. Softw. Pract. Exp, 34, 1397-1411.
    • (2004) Softw. Pract. Exp , vol.34 , pp. 1397-1411
    • Manzini, G.1    Rastero, M.2
  • 11
    • 13844281512 scopus 로고    scopus 로고
    • An efficient normalized maximum likelihood algorithm for DMA sequence compression
    • DOI 10.1145/1055709.1055711
    • Korodi, G. and Tabus, I. (2005) An efficient normalized maximum likelihood algorithm for DNA sequence compression. ACM T. Inform. Syst., 23, 3-34. (Pubitemid 40245824)
    • (2005) ACM Transactions on Information Systems , vol.23 , Issue.1 , pp. 3-34
    • Korodi, G.1    Tabus, I.2
  • 12
    • 26444479436 scopus 로고    scopus 로고
    • DNA compression challenge revisited
    • Combinatorial Pattern Matching: Proceedings of CPM-2005 Springer, Jeju Island, Korea
    • Behzadi, B. and Le Fessant, F. (2005) DNA compression challenge revisited. In Combinatorial Pattern Matching: Proceedings of CPM-2005, Vol. 3537 of LNCS. Springer, Jeju Island, Korea, pp. 190-200.
    • (2005) LNCS , vol.3537 , pp. 190-200
    • Behzadi, B.1    Le Fessant, F.2
  • 13
    • 34547635395 scopus 로고    scopus 로고
    • Normalized maximum likelihood model of order-1 for the compression of DNA sequences
    • DOI 10.1109/DCC.2007.60, 4148742, Proceedings - DCC 2007: 2007 Data Compression Conference
    • Korodi, G. and Tabus, I. (2007) Normalized maximum likelihood model of order-1 for the compression of DNA sequences. In Proceedings of the Data Compression Conference, DCC-2007. IEEE, Snowbird. Utah, pp. 33-42. (Pubitemid 47201855)
    • (2007) Data Compression Conference Proceedings , pp. 33-42
    • Korodi, G.1    Tabus, I.2
  • 14
    • 34547630480 scopus 로고    scopus 로고
    • A simple statistical algorithm for biological sequence compression
    • DOI 10.1109/DCC.2007.7, 4148743, Proceedings - DCC 2007: 2007 Data Compression Conference
    • Cao, M. D., Dix, T. I., Allison, L. and Mears, C. (2007) A simple statistical algorithm for biological sequence compression. Proceedings of the Data Compression Conference, DCC-2007. IEEE, Snowbird. Utah, pp. 43-52. (Pubitemid 47201856)
    • (2007) Data Compression Conference Proceedings , pp. 43-52
    • Cao, M.D.1    Dix, T.I.2    Allison, L.3    Mears, C.4
  • 15
    • 79959722141 scopus 로고    scopus 로고
    • On the representability of complete genomes by multiple competing finite-context (Markov) models
    • Pinho, A. J., Ferreira, P. J. S. G., Neves, A. J. R. and Bastos, C. A. C. (2011) On the representability of complete genomes by multiple competing finite-context (Markov) models. PLoS ONE, 6, e21588.
    • (2011) PLoS ONE , vol.6
    • Pinho, A.J.1    Ferreira, P.J.S.G.2    Neves, A.J.R.3    Bastos, C.A.C.4
  • 16
    • 67649170975 scopus 로고    scopus 로고
    • Textual data compression in computational biology: A synopsis
    • Giancarlo, R., Scaturro, D. and Utro, F. (2009) Textual data compression in computational biology: a synopsis. Bioinformatics, 25, 1575-1586.
    • (2009) Bioinformatics , vol.25 , pp. 1575-1586
    • Giancarlo, R.1    Scaturro, D.2    Utro, F.3
  • 18
    • 79951481957 scopus 로고    scopus 로고
    • Initial impact of the sequencing of the human genome
    • Lander, E. S. (2011) Initial impact of the sequencing of the human genome. Nature, 470, 187-197.
    • (2011) Nature , vol.470 , pp. 187-197
    • Lander, E.S.1
  • 19
    • 77950456427 scopus 로고    scopus 로고
    • Multiple personal genomes await
    • Venter, J. C. (2010) Multiple personal genomes await. Nature, 464, 676-677.
    • (2010) Nature , vol.464 , pp. 676-677
    • Venter, J.C.1
  • 20
    • 58349097721 scopus 로고    scopus 로고
    • Human genomes as email attachments
    • Christley, S., Lu, Y., Li, C. and Xie, X. (2009) Human genomes as email attachments. Bioinformatics, 25, 274-275.
    • (2009) Bioinformatics , vol.25 , pp. 274-275
    • Christley, S.1    Lu, Y.2    Li, C.3    Xie, X.4
  • 21
    • 67649855126 scopus 로고    scopus 로고
    • Data structures and compression algorithms for genomic sequence data
    • Brandon, M. C., Wallace, D. C. and Baldi, P. (2009) Data structures and compression algorithms for genomic sequence data. Bioinformatics, 25, 1731-1738.
    • (2009) Bioinformatics , vol.25 , pp. 1731-1738
    • Brandon, M.C.1    Wallace, D.C.2    Baldi, P.3
  • 22
    • 79954595666 scopus 로고    scopus 로고
    • A novel compression tool for efficient storage of genome resequencing data
    • Wang, C. and Zhang, D. (2011) A novel compression tool for efficient storage of genome resequencing data. Nucleic Acids Res., 39, e45.
    • (2011) Nucleic Acids Res. , vol.39
    • Wang, C.1    Zhang, D.2
  • 24
    • 77955886068 scopus 로고    scopus 로고
    • G-SQZ: Compact encoding of genomic sequence and quality data
    • Tembe, W., Lowey, J. and Suh, E. (2010) G-SQZ: compact encoding of genomic sequence and quality data. Bioinformatics, 26, 2192-2194.
    • (2010) Bioinformatics , vol.26 , pp. 2192-2194
    • Tembe, W.1    Lowey, J.2    Suh, E.3
  • 25
    • 79952580139 scopus 로고    scopus 로고
    • Compression of DNA sequence reads in FASTQ format
    • Deorowicz, S. and Grabowski, S. (2011) Compression of DNA sequence reads in FASTQ format. Bioinformatics, 27, 860-862.
    • (2011) Bioinformatics , vol.27 , pp. 860-862
    • Deorowicz, S.1    Grabowski, S.2
  • 26
    • 79955554401 scopus 로고    scopus 로고
    • Efficient storage of high throughput DNA sequencing data using reference-based compression
    • Fritz, M. H.-Y., Leinonen, R., Cochrane, G. and Birney, E. (2011) Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome Res., 21, 734-740.
    • (2011) Genome Res. , vol.21 , pp. 734-740
    • Fritz, M.H.-Y.1    Leinonen, R.2    Cochrane, G.3    Birney, E.4
  • 35
    • 2042437650 scopus 로고    scopus 로고
    • Initial sequencing and analysis of the human genome
    • The International Human Genome Sequencing Consortium
    • The International Human Genome Sequencing Consortium (2001) Initial sequencing and analysis of the human genome. Nature, 409, 860-921.
    • (2001) Nature , vol.409 , pp. 860-921
  • 36
    • 0000506580 scopus 로고
    • Generalized Kraft inequality and arithmetic coding
    • Rissanen, J (1976) Generalized Kraft inequality and arithmetic coding. IBM J. Res. Develop, 20, 198-203.
    • (1976) IBM J. Res. Develop , vol.20 , pp. 198-203
    • Rissanen, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.