메뉴 건너뛰기




Volumn 2, Issue 4, 2009, Pages 1429-1448

Linear-Time text compression by longest-first substitution

Author keywords

Grammar based text compression; Linear time algorithms; Suffix trees

Indexed keywords


EID: 77953038533     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a2041429     Document Type: Article
Times cited : (19)

References (33)
  • 2
    • 0942279288 scopus 로고    scopus 로고
    • Approximate Matching of Run-Length Compressed Strings
    • Mäkinen, V.; Ukkonen, E.; Navarro, G. Approximate Matching of Run-Length Compressed Strings. Algorithmica 2003, 35, 347-369.
    • (2003) Algorithmica , vol.35 , pp. 347-369
    • Mäkinen, V.1    Ukkonen, E.2    Navarro, G.3
  • 7
    • 0002044093 scopus 로고    scopus 로고
    • Identifying hierarchical structure in sequences: a linear-time algorithm
    • Nevill-Manning, C. G.; Witten, I. H. Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artificial Intelligence Research 1997, 7, 67-82.
    • (1997) J. Artificial Intelligence Research , vol.7 , pp. 67-82
    • Nevill-Manning, C.G.1    Witten, I.H.2
  • 8
    • 10644257127 scopus 로고    scopus 로고
    • Online and offline heuristics for inferring hierarchies of repetitions in sequences
    • Nevill-Manning, C. G.; Witten, I. H. Online and offline heuristics for inferring hierarchies of repetitions in sequences. Proc. IEEE 2000, 88, 1745-1755.
    • (2000) Proc. IEEE , vol.88 , pp. 1745-1755
    • Nevill-Manning, C.G.1    Witten, I.H.2
  • 9
    • 67649170975 scopus 로고    scopus 로고
    • Textual data compression in computational biology: a synopsis
    • Giancarlo, R.; Scaturro, D.; Utro, F. Textual data compression in computational biology: a synopsis. Bioinformatics 2009, 25, 1575-1586.
    • (2009) Bioinformatics , vol.25 , pp. 1575-1586
    • Giancarlo, R.1    Scaturro, D.2    Utro, F.3
  • 10
    • 0034188132 scopus 로고    scopus 로고
    • Grammar-based codes: A new class of universal lossless source codes
    • Kieffer, J. C.; Yang, E.-H. Grammar-based codes: A new class of universal lossless source codes. IEEE Transactions on Information Theory 2000, 46, 737-754.
    • (2000) IEEE Transactions on Information Theory , vol.46 , pp. 737-754
    • Kieffer, J.C.1    Yang, E.-H.2
  • 11
    • 84859635473 scopus 로고
    • NP-completeness Results Concerning Data Compression. Technical Report 234, Department of Electrical Engineering and Computer Science, Princeton University
    • Storer, J. NP-completeness Results Concerning Data Compression. Technical Report 234, Department of Electrical Engineering and Computer Science, Princeton University, 1977.
    • (1977)
    • Storer, J.1
  • 12
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding
    • Ziv, J.; Lempel, A. Compression of individual sequences via variable-rate coding. IEEE Trans. Information Theory 1978, 24, 530-536.
    • (1978) IEEE Trans. Information Theory , vol.24 , pp. 530-536
    • Ziv, J.1    Lempel, A.2
  • 13
    • 0021439618 scopus 로고
    • A Technique for High-Performance Data Compression
    • Welch, T. A. A Technique for High-Performance Data Compression. IEEE Computer 1984, 17, 8-19.
    • (1984) IEEE Computer , vol.17 , pp. 8-19
    • Welch, T.A.1
  • 15
    • 18544376055 scopus 로고    scopus 로고
    • A fully linear-time approximation algorithm for grammar-based compression
    • Sakamoto, H. A fully linear-time approximation algorithm for grammar-based compression. Journal of Discrete Algorithms 2005, 3, 416-430.
    • (2005) Journal of Discrete Algorithms , vol.3 , pp. 416-430
    • Sakamoto, H.1
  • 16
    • 0038238644 scopus 로고    scopus 로고
    • Application of Lempel-Ziv factorization to the approximation of grammar-based compression
    • Rytter, W. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science 2003, 302, 211-222.
    • (2003) Theoretical Computer Science , vol.302 , pp. 211-222
    • Rytter, W.1
  • 19
    • 84982036565 scopus 로고
    • An algorithm for the segmentation for an artificial language analogue
    • Wolff, J. G. An algorithm for the segmentation for an artificial language analogue. British Journal of Psychology 1975, 66, 79-90.
    • (1975) British Journal of Psychology , vol.66 , pp. 79-90
    • Wolff, J.G.1
  • 21
    • 2642584062 scopus 로고    scopus 로고
    • Off-Line Compression by Greedy Textual Substitution
    • Apostolico, A.; Lonardi, S. Off-Line Compression by Greedy Textual Substitution. Proc. IEEE 2000, 88, 1733-1744.
    • (2000) Proc. IEEE , vol.88 , pp. 1733-1744
    • Apostolico, A.1    Lonardi, S.2
  • 22
    • 0033899414 scopus 로고    scopus 로고
    • Compression of Biological Sequences by Greedy Off-Line Textual Substitution
    • IEEE Computer Society
    • Apostolico, A.; Lonardi, S. Compression of Biological Sequences by Greedy Off-Line Textual Substitution. In Proc. Data Compression Conference '00 (DCC'00). IEEE Computer Society, 2000, pp. 143-152.
    • (2000) Proc. Data Compression Conference '00 (DCC'00). , pp. 143-152
    • Apostolico, A.1    Lonardi, S.2
  • 23
    • 0017493286 scopus 로고
    • A Universal Algorithm for Sequential Data Compression
    • Ziv, J.; Lempel, A. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 1977, IT-23, 337-349.
    • (1977) IEEE Transactions on Information Theory , vol.IT-23 , pp. 337-349
    • Ziv, J.1    Lempel, A.2
  • 29
    • 0001704377 scopus 로고
    • On-line Construction of Suffix Trees
    • Ukkonen, E. On-line Construction of Suffix Trees. Algorithmica 1995, 14, 249-260.
    • (1995) Algorithmica , vol.14 , pp. 249-260
    • Ukkonen, E.1
  • 31
    • 0000559577 scopus 로고    scopus 로고
    • Data structures and algorithms for the string statistics problem
    • Apostolico, A.; Preparata, F. P. Data structures and algorithms for the string statistics problem. Algorithmica 1996, 15, 481-494.
    • (1996) Algorithmica , vol.15 , pp. 481-494
    • Apostolico, A.1    Preparata, F.P.2


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