메뉴 건너뛰기




Volumn , Issue , 2007, Pages 33-42

Normalized maximum likelihood model of order-1 for the compression of DNA sequences

Author keywords

[No Author keywords available]

Indexed keywords

GENES; IMAGE CODING; IMAGE COMPRESSION; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD;

EID: 34547635395     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2007.60     Document Type: Conference Paper
Times cited : (27)

References (12)
  • 3
    • 0036947893 scopus 로고    scopus 로고
    • DNACompress: Fast and effective DNA sequence compression
    • X. Chen, M. Li, B. Ma and J. Tromp, "DNACompress: fast and effective DNA sequence compression," Bioinformatica, vol. 18, pp. 1696-1698, 2002.
    • (2002) Bioinformatica , vol.18 , pp. 1696-1698
    • Chen, X.1    Li, M.2    Ma, B.3    Tromp, J.4
  • 5
    • 0000100455 scopus 로고
    • A new challenge for compression algorithms: Genetic sequences
    • S. Grumbach and F. Tahi, "A new challenge for compression algorithms: Genetic sequences," J. Inform. Process. Manage., vol. 30, no. 6, pp. 875-886, 1994.
    • (1994) J. Inform. Process. Manage , vol.30 , Issue.6 , pp. 875-886
    • Grumbach, S.1    Tahi, F.2
  • 6
    • 13844281512 scopus 로고    scopus 로고
    • An efficient normalized maximum likelihood algorithm for DNA sequence compression
    • G. Korodi and L Tabus, "An efficient normalized maximum likelihood algorithm for DNA sequence compression," ACM Transactions on Information Systems, vol. 23, no. 1, pp. 3-34, 2005.
    • (2005) ACM Transactions on Information Systems , vol.23 , Issue.1 , pp. 3-34
    • Korodi, G.1    Tabus, L.2
  • 7
    • 0036202921 scopus 로고    scopus 로고
    • PatternHunter: Faster and More Sensitive Homology Search
    • B. Ma, J. Tromp and M. Li, "PatternHunter: Faster and More Sensitive Homology Search," Bioinformatica, vol. 18, pp. 440-445, 2002.
    • (2002) Bioinformatica , vol.18 , pp. 440-445
    • Ma, B.1    Tromp, J.2    Li, M.3
  • 8
    • 0034578442 scopus 로고    scopus 로고
    • Biological Sequence Compression Algorithms
    • Universal Academy Press, pp
    • T. Matsumoto, K. Sadakane and H. Imai, "Biological Sequence Compression Algorithms," Genome Informatics Workshop, Universal Academy Press, pp. 43-52, 2000.
    • (2000) Genome Informatics Workshop , pp. 43-52
    • Matsumoto, T.1    Sadakane, K.2    Imai, H.3
  • 10
    • 0004339452 scopus 로고
    • A Guaranteed Compression Scheme for Repetitive DNA Sequences
    • LIFL Lille I Univ, Tech. Rep. IT-285
    • E. Rivals, J.P. Delahaye, M. Dauchet and O. Delgrange, "A Guaranteed Compression Scheme for Repetitive DNA Sequences." LIFL Lille I Univ., Tech. Rep. IT-285, 1995.
    • (1995)
    • Rivals, E.1    Delahaye, J.P.2    Dauchet, M.3    Delgrange, O.4
  • 11
    • 34547630306 scopus 로고    scopus 로고
    • DNA sequence compression using the normalized maximum likelihood model for discrete regression
    • I. Tabus, G. Korodi and J. Rissanen, "DNA sequence compression using the normalized maximum likelihood model for discrete regression," Data Compression Conference 2003, DCC '03, pp. 253-262, 2003.
    • (2003) Data Compression Conference 2003, DCC '03 , pp. 253-262
    • Tabus, I.1    Korodi, G.2    Rissanen, J.3
  • 12
    • 34547627837 scopus 로고    scopus 로고
    • The Human Genome, ftp://ftp.ncbi.nlm.nih.gov/genomes/H_sapiens/ April_14_2003
    • The Human Genome, ftp://ftp.ncbi.nlm.nih.gov/genomes/H_sapiens/ April_14_2003


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