메뉴 건너뛰기




Volumn 190, Issue , 2009, Pages 279-289

Probabilistic approach for DNA compression
[No Author Info available]

Author keywords

[No Author keywords available]

Indexed keywords


EID: 61449196761     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-00193-2_14     Document Type: Article
Times cited : (2)

References (16)
  • 2
    • 0034578442 scopus 로고    scopus 로고
    • Biological Sequences Compression Algorithms. Genome Information Ser
    • Matsumuto, T., Sadakane, K., Imai, H.: Biological Sequences Compression Algorithms. Genome Information Ser. Workshop Genome Inform 11, 43-52 (2000)
    • (2000) Workshop Genome Inform , vol.11 , pp. 43-52
    • Matsumuto, T.1    Sadakane, K.2    Imai, H.3
  • 5
    • 0018019231 scopus 로고
    • Compression of Individual Sequences using Variable-Rate Encoding
    • Ziv, J., Limpel, A.: Compression of Individual Sequences using Variable-Rate Encoding. IEE Transactions on Information Theory 24, 530-536 (1978)
    • (1978) IEE Transactions on Information Theory , vol.24 , pp. 530-536
    • Ziv, J.1    Limpel, A.2
  • 6
    • 0017493286 scopus 로고
    • A Universal Algorithm for Sequential Data Compression
    • Ziv, J., Limpel, A.: A Universal Algorithm for Sequential Data Compression. IEE Transactions on Information Theory 23(3), 337-343 (1977)
    • (1977) IEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Limpel, A.2
  • 7
    • 0030519246 scopus 로고    scopus 로고
    • Universal Data Compression Algorithm based on Approximate String Matching
    • Sadel, I.: Universal Data Compression Algorithm based on Approximate String Matching. In: Probability in the Engineering and Informational Sciences, pp. 465-486 (1996)
    • (1996) Probability in the Engineering and Informational Sciences , pp. 465-486
    • Sadel, I.1
  • 8
    • 34547405779 scopus 로고    scopus 로고
    • A Compression Algorithm for DNA Sequences and its Application in Genome Comparison
    • Chen, X., Kwong, S., Li, M.: A Compression Algorithm for DNA Sequences and its Application in Genome Comparison. Genomic 12, 512-514 (2001)
    • (2001) Genomic , vol.12 , pp. 512-514
    • Chen, X.1    Kwong, S.2    Li, M.3
  • 10
    • 0035102453 scopus 로고    scopus 로고
    • An Information based Sequences Distance and its Application to whole Mitochondrial Genome
    • Li, M., Badger, J.H., Chen, J.H., Kwong, S., Kerney, P., Zhang, H.: An Information based Sequences Distance and its Application to whole Mitochondrial Genome. Bioinformatics 17(2), 149-154 (2001)
    • (2001) Bioinformatics , vol.17 , Issue.2 , pp. 149-154
    • Li, M.1    Badger, J.H.2    Chen, J.H.3    Kwong, S.4    Kerney, P.5    Zhang, H.6
  • 11
    • 85142185216 scopus 로고    scopus 로고
    • Chen, X., La, M., Ma, B., Tromp, J.: DnaCompress: Fast and Selective DNA Sequence Compression. Bioinformatics 18, 1696-1698 (2002)
    • Chen, X., La, M., Ma, B., Tromp, J.: DnaCompress: Fast and Selective DNA Sequence Compression. Bioinformatics 18, 1696-1698 (2002)
  • 12
    • 0036202921 scopus 로고    scopus 로고
    • Patternhunter-faster and more sensitive homology search
    • Ma, B., Tromp, J., Li, M.: Patternhunter-faster and more sensitive homology search. Bioinformatics 18, 440-445 (2002)
    • (2002) Bioinformatics , vol.18 , pp. 440-445
    • Ma, B.1    Tromp, J.2    Li, M.3
  • 16
    • 0007475289 scopus 로고    scopus 로고
    • Fast Discerning Repeats in DNA Sequences with a Compression Algorithm
    • Universal Academy Press, Tokyo
    • Rivals, E., Dauchet, M.: Fast Discerning Repeats in DNA Sequences with a Compression Algorithm. In: Proceedings of Genome Informatics Workshop, pp. 215-226. Universal Academy Press, Tokyo (1997)
    • (1997) Proceedings of Genome Informatics Workshop , pp. 215-226
    • Rivals, E.1    Dauchet, M.2


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