메뉴 건너뛰기




Volumn , Issue , 2005, Pages 321-330

Substring compression problems

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION STRUCTURES; STRING COMPRESSION; STRING MATCHING; SUBSTRING COMPRESSION;

EID: 20744439529     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (32)

References (37)
  • 1
    • 0030129729 scopus 로고    scopus 로고
    • Let sleeping files lie: Pattern matching in Z-compressed files
    • [ABF96]
    • [ABF96] A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52(2):299-307, 1996.
    • (1996) Journal of Computer and System Sciences , vol.52 , Issue.2 , pp. 299-307
    • Amir, A.1    Benson, G.2    Farach, M.3
  • 4
    • 0000795886 scopus 로고    scopus 로고
    • Range searching
    • [Aga97]. J. E. Goodman and J. O'Rourke, editors, CRC Press
    • [Aga97] P. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, 1997.
    • (1997) Handbook of Discrete and Computational Geometry
    • Agarwal, P.1
  • 7
    • 0003573193 scopus 로고
    • A block-sorting lossless data compression algorithm
    • [BW94], Hewlett Packard Laboratories
    • [BW94] M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. Technical Report SRC-RR-124, Hewlett Packard Laboratories, 1994.
    • (1994) Technical Report , vol.SRC-RR-124
    • Burrows, M.1    Wheeler, D.J.2
  • 9
    • 0036947893 scopus 로고    scopus 로고
    • DNA-compress: Fast and effective DNA sequence compression
    • [CLMT02]
    • [CLMT02] X. Chen, M. Li, B. Ma, and J. Tromp. DNA-Compress: Fast and effective DNA sequence compression. Bioinformatics, 18(12):1696-1698, 2002.
    • (2002) Bioinformatics , vol.18 , Issue.12 , pp. 1696-1698
    • Chen, X.1    Li, M.2    Ma, B.3    Tromp, J.4
  • 11
    • 0002854989 scopus 로고
    • Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms
    • [CV86]
    • [CV86] R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th Symposium on Theory of Computing, pages 206-219, 1986.
    • (1986) Proceedings of the 18th Symposium on Theory of Computing , pp. 206-219
    • Cole, R.1    Vishkin, U.2
  • 15
    • 0000100455 scopus 로고
    • A new challenge for compression algorithms: Genetic sequences
    • [GT94]
    • [GT94] S. Grumbach and F. Tahi. A new challenge for compression algorithms: genetic sequences. Information Processing and Management, 30(6):875-886, 1994.
    • (1994) Information Processing and Management , vol.30 , Issue.6 , pp. 875-886
    • Grumbach, S.1    Tahi, F.2
  • 17
    • 0033690274 scopus 로고    scopus 로고
    • Compressed suffix arrays and suffix trees with applications to text indexing and string matching
    • [GV00]
    • [GV00] R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings ACM Symposium on the Theory of Computing, pages 397-406, 2000.
    • (2000) Proceedings ACM Symposium on the Theory of Computing , pp. 397-406
    • Grossi, R.1    Vitter, J.S.2
  • 20
    • 0022030599 scopus 로고
    • Efficient randomized pattern-matching algorithms
    • [KR87]
    • [KR87] R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
    • (1987) IBM Journal of Research and Development , vol.31 , Issue.2 , pp. 249-260
    • Karp, R.M.1    Rabin, M.O.2
  • 24
    • 21144458670 scopus 로고
    • String matching with preprocessing of text and pattern
    • [Nao91]. Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP)
    • [Nao91] M. Naor. String matching with preprocessing of text and pattern. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 739-750, 1991.
    • (1991) Lecture Notes in Computer Science , vol.510 , pp. 739-750
    • Naor, M.1
  • 26
    • 0030935318 scopus 로고    scopus 로고
    • Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in DNA sequences
    • +97]
    • +97] E. Rivals, O. Delgrange, J.-P. Delahaye, M. Dauchet, M.-O. Delorme, A. Henaut, and E. Ollivier. Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. Comp. Appl. BioSci, 13(2):131-136, 1997.
    • (1997) Comp. Appl. BioSci , vol.13 , Issue.2 , pp. 131-136
    • Rivals, E.1    Delgrange, O.2    Delahaye, J.-P.3    Dauchet, M.4    Delorme, M.-O.5    Henaut, A.6    Ollivier, E.7
  • 29
    • 0347494019 scopus 로고
    • Linear algorithm for data compression via string matching
    • [RPE81]
    • [RPE81] M. Rodeh, V. R. Pratt, and S. Even. Linear algorithm for data compression via string matching. Journal of the ACM, 28(1):16-24, 1981.
    • (1981) Journal of the ACM , vol.28 , Issue.1 , pp. 16-24
    • Rodeh, M.1    Pratt, V.R.2    Even, S.3
  • 31
    • 0020190931 scopus 로고
    • Data compression via textural substitution
    • [SS82]
    • [SS82] J. A. Storer and T. G. Szymanski. Data compression via textural substitution. Journal of the ACM, 29(4), 1982.
    • (1982) Journal of the ACM , vol.29 , Issue.4
    • Storer, J.A.1    Szymanski, T.G.2
  • 32
    • 0142249968 scopus 로고    scopus 로고
    • Large edit distance with multiple block operations
    • [SS03]. 10th International Symposium on String Processing and Information Retrieval (SPIRE)
    • [SS03] D. Shapira and J. Storer. Large edit distance with multiple block operations. In 10th International Symposium on String Processing and Information Retrieval (SPIRE), volume 2857 of Lecture Notes in Computer Science, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2857
    • Shapira, D.1    Storer, J.2
  • 33
    • 20744454083 scopus 로고
    • Data compression using locally consistent parsing
    • [SV95], University of Maryland Department of Computer Science
    • [SV95] S. C. Sahinalp and U. Vishkin. Data compression using locally consistent parsing. Technical report, University of Maryland Department of Computer Science, 1995.
    • (1995) Technical Report
    • Sahinalp, S.C.1    Vishkin, U.2
  • 37
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • [ZL77]
    • [ZL77] J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23:337-343, 1977.
    • (1977) IEEE Transactions on Information Theory , vol.IT-23 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


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