메뉴 건너뛰기




Volumn , Issue , 1993, Pages 340-350

Compression of DNA sequences

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DNA SEQUENCES;

EID: 84925291641     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.1993.253115     Document Type: Conference Paper
Times cited : (167)

References (17)
  • 1
    • 85063426989 scopus 로고
    • Optimal parallel algorithms for periods, palindromes and squares
    • [ABG92]
    • [ABG92] A. Apostolico, D. Breslauer, and Z. Galil. Optimal parallel algorithms for periods, palindromes and squares. In unpublished, 1992.
    • (1992) Unpublished
    • Apostolico, A.1    Breslauer, D.2    Galil, Z.3
  • 2
    • 0025239561 scopus 로고
    • Periodicities in coding and noncoding regions in genes
    • [AM90]
    • [AM90] D. G. Arques and C. J. Michel. Periodicities in coding and noncoding regions in genes. Journal of Theoretical Biology, 143:307-318, 1990.
    • (1990) Journal of Theoretical Biology , vol.143 , pp. 307-318
    • Arques, D.G.1    Michel, C.J.2
  • 3
    • 0002989012 scopus 로고
    • [BenSS] chapter Logical Depth and Physical Complexity, R. Herken, oxford university press edition
    • [BenSS] C. H. Bennett. The Universal Turing Machine: A Half-Century Survey, chapter Logical Depth and Physical Complexity, pages 227-257. R. Herken, oxford university press edition, 1988.
    • (1988) The Universal Turing Machine: A Half-Century Survey , pp. 227-257
    • Bennett, C.H.1
  • 4
    • 0024640034 scopus 로고
    • Data compression with finite windows
    • [FG89]
    • [FG89] E. R. Fiala and D. H. Greene. Data compression with finite windows. Communications of the ACM, 32(4):490-505, 1989.
    • (1989) Communications of the ACM , vol.32 , Issue.4 , pp. 490-505
    • Fiala, E.R.1    Greene, D.H.2
  • 5
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes
    • [Huf52] Sep
    • [Huf52] D. A. Huffman. A method for the construction of minimum-redundancy codes. In Proc. IRE, volume 40, pages 1098-1101, Sep 1952.
    • (1952) Proc. IRE , vol.40 , pp. 1098-1101
    • Huffman, D.A.1
  • 6
    • 77956987191 scopus 로고
    • Panel: Data, and knowledge bases for genome mapping: What lies ahead?
    • [Kam91]
    • [Kam91] N. Kamel. Panel: Data, and knowledge bases for genome mapping: What lies ahead? In Proc. Int. Conf. on Very Large Databases, 1991.
    • (1991) Proc. Int. Conf. On Very Large Databases
    • Kamel, N.1
  • 7
    • 0001902056 scopus 로고
    • Three approaches for defining the concept of information quantity
    • [Kol65]
    • [Kol65] A.N. Kolmogorov. Three approaches for defining the concept of information quantity. Information Transmission, 1:3-11, 1965.
    • (1965) Information Transmission , vol.1 , pp. 3-11
    • Kolmogorov, A.N.1
  • 9
    • 0016880887 scopus 로고
    • On the complexity of finite sequences
    • [LZ76]
    • [LZ76] A. Lempel and J. Ziv. On the complexity of finite sequences. IEEE Trans. Inform. Theory, 22(1):75 81, 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.22 , Issue.1 , pp. 75-81
    • Lempel, A.1    Ziv, J.2
  • 10
    • 84968989005 scopus 로고
    • The complete nucleotide sequence of the tobacco chloroplast genome: Its gene organisation and expression
    • [SOT+86]
    • [SOT+86] K. Shinozaki, M. Ohme, M. Tanaka, T. Wakasugi, and N. Hayashida. The complete nucleotide sequence of the tobacco chloroplast genome: its gene organisation and expression. The EMBO Journal, 5(9):2043-2049, 1986.
    • (1986) The EMBO Journal , vol.5 , Issue.9 , pp. 2043-2049
    • Shinozaki, K.1    Ohme, M.2    Tanaka, M.3    Wakasugi, T.4    Hayashida, N.5
  • 11
    • 0020190931 scopus 로고
    • Data compression via textual substitution
    • [SS82]
    • [SS82] J. A. Storer and T. G. Szymansk. Data compression via textual substitution. Journal of the ACM, 29(4):928-951, 1982.
    • (1982) Journal of the ACM , vol.29 , Issue.4 , pp. 928-951
    • Storer, J.A.1    Szymansk, T.G.2
  • 14
    • 0021439618 scopus 로고
    • A technique for high performance data compression
    • [Wel84]
    • [Wel84] T. A. Welch. A technique for high performance data compression. Computer, pages 8-19, 1984.
    • (1984) Computer , pp. 8-19
    • Welch, T.A.1
  • 15
    • 0027113207 scopus 로고
    • Data compression with factor automata
    • [Zip92]
    • [Zip92] M. Zipstein. Data compression with factor automata. Theoretical Computer Science, pages 213-221, 1992.
    • (1992) Theoretical Computer Science , pp. 213-221
    • Zipstein, M.1
  • 16
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • [ZL77] May
    • [ZL77] J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, May 1977.
    • (1977) IEEE Transactions On Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 17
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding
    • [ZL78] Sept
    • [ZL78] J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530-536, Sept 1978.
    • (1978) IEEE Transactions On Information Theory , vol.24 , Issue.5 , pp. 530-536
    • Ziv, J.1    Lempel, A.2


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