메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Inverted-repeats-aware finite-context models for DNA coding

Author keywords

[No Author keywords available]

Indexed keywords

DNA CODING; ENCODING METHODS; INVERTED REPEAT; MODEL ORDER; MODEL UPDATING; SEQUENCE COMPRESSION;

EID: 84863762123     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (20)
  • 1
    • 0030708567 scopus 로고    scopus 로고
    • Sequencing the human genome
    • Oct.
    • L. Rowen, G. Mahairas, and L. Hood, "Sequencing the human genome," Science, vol. 278, pp. 605-607, Oct. 1997.
    • (1997) Science , vol.278 , pp. 605-607
    • Rowen, L.1    Mahairas, G.2    Hood, L.3
  • 2
    • 0034649688 scopus 로고    scopus 로고
    • A. thaliana genome
    • Dec.
    • C. Dennis and C. Surridge, "A. thaliana genome," Nature, vol. 408, pp. 791, Dec. 2000.
    • (2000) Nature , vol.408 , pp. 791
    • Dennis, C.1    Surridge, C.2
  • 6
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. on Information Theory, vol. 23, pp. 337-343, 1977.
    • (1977) IEEE Trans. on Information Theory , vol.23 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 7
    • 0000100455 scopus 로고
    • A new challenge for compression algorithms: Genetic sequences
    • S. Grumbach and F. Tahi, "A new challenge for compression algorithms: genetic sequences," Information Processing & Management, vol. 30, no. 6, pp. 875-886, 1994.
    • (1994) Information Processing & Management , vol.30 , Issue.6 , pp. 875-886
    • Grumbach, S.1    Tahi, F.2
  • 8
    • 0004339452 scopus 로고
    • A guaranteed compression scheme for repetitive DNA sequences
    • Université des Sciences et Technologies de Lille, Nov.
    • E. Rivals, J.-P. Delahaye, M. Dauchet, and O. Delgrange, "A guaranteed compression scheme for repetitive DNA sequences," Tech. Rep. IT-95-285, LIFL, Université des Sciences et Technologies de Lille, Nov. 1995.
    • (1995) Tech. Rep. IT-95-285, LIFL
    • Rivals, E.1    Delahaye, J.-P.2    Dauchet, M.3    Delgrange, O.4
  • 10
    • 0001941057 scopus 로고    scopus 로고
    • A compression algorithm for DNA sequences and its applications in genome comparison
    • K. Asai, S. Miyano, and T. Takagi, Eds., Tokyo, Japan
    • X. Chen, S. Kwong, and M. Li, "A compression algorithm for DNA sequences and its applications in genome comparison," in Genome Informatics 1999: Proc. of the 10th Workshop, K. Asai, S. Miyano, and T. Takagi, Eds., Tokyo, Japan, 1999, pp. 51-61.
    • (1999) Genome Informatics 1999: Proc. of the 10th Workshop , pp. 51-61
    • Chen, X.1    Kwong, S.2    Li, M.3
  • 12
    • 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," Bioinformatics, vol. 18, no. 12, pp. 1696-1698, 2002.
    • (2002) Bioinformatics , vol.18 , Issue.12 , pp. 1696-1698
    • Chen, X.1    Li, M.2    Ma, B.3    Tromp, J.4
  • 13
    • 0034578442 scopus 로고    scopus 로고
    • Biological sequence compression algorithms
    • A. K. Dunker, A. Konagaya, S. Miyano, and T. Takagi, Eds., Tokyo, Japan
    • T. Matsumoto, K. Sadakane, and H. Imai, "Biological sequence compression algorithms," in Genome Informatics 2000: Proc. of the 11th Workshop, A. K. Dunker, A. Konagaya, S. Miyano, and T. Takagi, Eds., Tokyo, Japan, 2000, pp. 43-52.
    • (2000) Genome Informatics 2000: Proc. of the 11th Workshop , pp. 43-52
    • Matsumoto, T.1    Sadakane, K.2    Imai, H.3
  • 15
    • 34547630306 scopus 로고    scopus 로고
    • DNA sequence compression using the normalized maximum likelihood model for discrete regression
    • Snowbird, Utah
    • I. Tabus, G. Korodi, and J. Rissanen, "DNA sequence compression using the normalized maximum likelihood model for discrete regression," in Proc. of the Data Compression Conf., DCC-2003, Snowbird, Utah, 2003, pp. 253-262.
    • (2003) Proc. of the Data Compression Conf., DCC-2003 , pp. 253-262
    • Tabus, I.1    Korodi, G.2    Rissanen, J.3
  • 16
    • 13844281512 scopus 로고    scopus 로고
    • An efficient normalized maximum likelihood algorithm for DNA sequence compression
    • Jan.
    • G. Korodi and I. Tabus, "An efficient normalized maximum likelihood algorithm for DNA sequence compression," ACM Trans. on Information Systems, vol. 23, no. 1, pp. 3-34, Jan. 2005.
    • (2005) ACM Trans. on Information Systems , vol.23 , Issue.1 , pp. 3-34
    • Korodi, G.1    Tabus, I.2
  • 17
    • 77954870239 scopus 로고    scopus 로고
    • DNA compression challenge revisited
    • Jeju Island, Korea, June, Lecture Notes in Computer Science, Springer
    • B. Behzadi and F. Le Fessant, "DNA compression challenge revisited," in Combinatorial Pattern Matching: Proc. of CPM-2005, Jeju Island, Korea, June 2005, Lecture Notes in Computer Science, Springer.
    • (2005) Combinatorial Pattern Matching: Proc. of CPM-2005
    • Behzadi, B.1    Le Fessant, F.2


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