메뉴 건너뛰기




Volumn 5, Issue 6, 2009, Pages 593-602

A lossless compression algorithm for DNA sequences

Author keywords

Approximate repeats; Encoding; LCA; Lossless compression algorithm; Palindrome

Indexed keywords

PALINDROMIC DNA; REPETITIVE DNA;

EID: 70350645184     PISSN: 17445485     EISSN: 17445493     Source Type: Journal    
DOI: 10.1504/IJBRA.2009.029040     Document Type: Article
Times cited : (10)

References (17)
  • 2
    • 0033899414 scopus 로고    scopus 로고
    • Compression of biological sequences by greedy offline textual substitution
    • IEEE Computer Society Press
    • Apostolico, A. and Lonardi, S. (2000) 'Compression of biological sequences by greedy offline textual substitution', Proc. Data Compression Conference, IEEE Computer Society Press, pp.143-152.
    • (2000) Proc. Data Compression Conference , pp. 143-152
    • Apostolico, A.1    Lonardi, S.2
  • 6
    • 0001941057 scopus 로고    scopus 로고
    • A compression algorithm for DNA sequences and its applications in genome comparison
    • Tokyo, Japan
    • Chen, X., Kwong, S. and Li, M. (1999) 'A compression algorithm for DNA sequences and its applications in genome comparison', The 10th Workshop on Genome Informatics, Tokyo, Japan, pp.51-61.
    • (1999) The 10th Workshop on Genome Informatics , pp. 51-61
    • 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', Bioinformati.es, Vol.18, pp.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
  • 11
    • 84925291641 scopus 로고
    • Compression of DNA sequences
    • IEEE Computer Society Press
    • Grumbach, S. and Tahi, F. (1993) 'Compression of DNA sequences', Data Compression Conference, IEEE Computer Society Press, pp.340-350.
    • (1993) Data Compression Conference , pp. 340-350
    • Grumbach, S.1    Tahi, F.2
  • 12
    • 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', Journal of Information Processing and Management, Vol.30, pp.875-1866 (Pubitemid 124012808)
    • (1994) Information Processing and Management , vol.30 , Issue.6 , pp. 875-886
    • Grumbach, S.1
  • 13
    • 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 Transactions on Information Systems, Vol.23, No.1, pp.3-34. (Pubitemid 40245824)
    • (2005) ACM Transactions on Information Systems , vol.23 , Issue.1 , pp. 3-34
    • Korodi, G.1    Tabus, I.2
  • 14
    • 0036202921 scopus 로고    scopus 로고
    • PatternHunter: Faster and more sensitive homology search
    • Ma, B., Tromp, J. and Li, M. (2002) 'PatternHunter-faster and more sensitive homology search', Bioinformatics, Vol.18, pp.440-445. (Pubitemid 34284945)
    • (2002) Bioinformatics , vol.18 , Issue.3 , pp. 440-445
    • Ma, B.1    Tromp, J.2    Li, M.3


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