메뉴 건너뛰기




Volumn 5757 LNCS, Issue , 2009, Pages 420-431

On optimally partitioning a text to improve its compression

Author keywords

[No Author keywords available]

Indexed keywords

INPUT STRING; OPTIMAL PARTITIONS; POSITIVE CONSTANT;

EID: 70350408798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_38     Document Type: Conference Paper
Times cited : (3)

References (26)
  • 1
    • 0035367637 scopus 로고    scopus 로고
    • Data compression with long repeated strings
    • 1
    • 1. Bentley, J.L., McIlroy, M.D.: Data compression with long repeated strings. Information Sciences 135(1-2), 1-11 (2001)
    • (2001) Information Sciences , vol.135 , Issue.1-2 , pp. 1-11
    • Bentley, J.L.1    McIlroy, M.D.2
  • 3
    • 4243175869 scopus 로고    scopus 로고
    • Improving table compression with combinatorial optimization
    • 3
    • 3. Buchsbaum, A.L., Fowler, G.S., Giancarlo, R.: Improving table compression with combinatorial optimization. J. ACM 50(6), 825-851 (2003)
    • (2003) J. ACM , vol.50 , Issue.6 , pp. 825-851
    • Buchsbaum, A.L.1    Fowler, G.S.2    Giancarlo, R.3
  • 4
    • 70350367947 scopus 로고    scopus 로고
    • Table compression
    • 4, Kao, M.Y, ed, Springer, Heidelberg
    • 4. Buchsbaum, A.L., Giancarlo, R.: Table compression. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 939-942. Springer, Heidelberg (2008)
    • (2008) Encyclopedia of Algorithms , pp. 939-942
    • Buchsbaum, A.L.1    Giancarlo, R.2
  • 5
    • 70350376828 scopus 로고    scopus 로고
    • 5. Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
    • 5. Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
  • 6
    • 47749140025 scopus 로고    scopus 로고
    • Bigtable: A distributed storage system for structured data
    • 6
    • 6. Chang, F., Dean, J., Ghemawat, S., et al.: Bigtable: A distributed storage system for structured data. ACM Trans. Comput. Syst. 26(2) (2008)
    • (2008) ACM Trans. Comput. Syst , vol.26 , Issue.2
    • Chang, F.1    Dean, J.2    Ghemawat, S.3
  • 8
    • 33750716855 scopus 로고    scopus 로고
    • 8. Ferragina, P., Giancarlo, R., Manzini, G.: The engineering of a compression boosting library: Theory vs practice in BWT compression. In: Azar, Y., Erlebach, T.(eds.) ESA 2006. LNCS, 4168, pp. 756-767. Springer, Heidelberg (2006)
    • 8. Ferragina, P., Giancarlo, R., Manzini, G.: The engineering of a compression boosting library: Theory vs practice in BWT compression. In: Azar, Y., Erlebach, T.(eds.) ESA 2006. LNCS, vol. 4168, pp. 756-767. Springer, Heidelberg (2006)
  • 10
    • 30544455566 scopus 로고    scopus 로고
    • Boosting textual compression in optimal linear time
    • 10
    • 10. Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. J. ACM 52, 688-713 (2005)
    • (2005) J. ACM , vol.52 , pp. 688-713
    • Ferragina, P.1    Giancarlo, R.2    Manzini, G.3    Sciortino, M.4
  • 11
    • 33748626529 scopus 로고    scopus 로고
    • Structuring labeled trees for optimal succinctness, and beyond
    • 11
    • 11. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proc. FOCS, pp. 184-193 (2005)
    • (2005) Proc. FOCS , pp. 184-193
    • Ferragina, P.1    Luccio, F.2    Manzini, G.3    Muthukrishnan, S.4
  • 12
    • 70350376829 scopus 로고    scopus 로고
    • 12. Ferragina, P., Nitto, I., Venturini, R.: On optimally partitioning a text to improve its compression. CoRR, abs/0906.4692 (2009)
    • 12. Ferragina, P., Nitto, I., Venturini, R.: On optimally partitioning a text to improve its compression. CoRR, abs/0906.4692 (2009)
  • 14
    • 35448978711 scopus 로고    scopus 로고
    • From first principles to the burrows and wheeler transform and beyond, via combinatorial optimization
    • 14
    • 14. Giancarlo, R., Restivo, A., Sciortino, M.: From first principles to the burrows and wheeler transform and beyond, via combinatorial optimization. Theoretical Computer Science 387(3), 236-248 (2007)
    • (2007) Theoretical Computer Science , vol.387 , Issue.3 , pp. 236-248
    • Giancarlo, R.1    Restivo, A.2    Sciortino, M.3
  • 15
    • 35248819207 scopus 로고    scopus 로고
    • 15. Giancarlo, R., Sciortino, M.: Optimal partitions of strings: A new class of Burrows- Wheeler compression algorithms. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, 2676, pp. 129-143. Springer, Heidelberg (2003)
    • 15. Giancarlo, R., Sciortino, M.: Optimal partitions of strings: A new class of Burrows- Wheeler compression algorithms. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 129-143. Springer, Heidelberg (2003)
  • 16
    • 0001561777 scopus 로고
    • Analysis of arithmetic coding for data compression
    • 16
    • 16. Howard, P.G., Vitter, J.S.: Analysis of arithmetic coding for data compression. Information Processing Management 28(6), 749-764 (1992)
    • (1992) Information Processing Management , vol.28 , Issue.6 , pp. 749-764
    • Howard, P.G.1    Vitter, J.S.2
  • 17
    • 35449007257 scopus 로고    scopus 로고
    • A simpler analysis of burrows-wheeler-based compression
    • 17
    • 17. Kaplan, H., Landau, S., Verbin, E.: A simpler analysis of burrows-wheeler-based compression. Theoretical Computer Science 387(3), 220-235 (2007)
    • (2007) Theoretical Computer Science , vol.387 , Issue.3 , pp. 220-235
    • Kaplan, H.1    Landau, S.2    Verbin, E.3
  • 18
    • 0033294876 scopus 로고    scopus 로고
    • Compression of low entropy strings with Lempel-Ziv algorithms
    • 18
    • 18. Kosaraju, R., Manzini, G.: Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing 29(3), 893-911 (1999)
    • (1999) SIAM Journal on Computing , vol.29 , Issue.3 , pp. 893-911
    • Kosaraju, R.1    Manzini, G.2
  • 20
    • 38049045198 scopus 로고    scopus 로고
    • 20. Mäkinen, V., Navarro, G.: Implicit compression boosting with applications to selfindexing. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, 4726, pp.229-241. Springer, Heidelberg (2007)
    • 20. Mäkinen, V., Navarro, G.: Implicit compression boosting with applications to selfindexing. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp.229-241. Springer, Heidelberg (2007)
  • 21
    • 0037967496 scopus 로고    scopus 로고
    • An analysis of the Burrows-Wheeler transform
    • 21
    • 21. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48(3), 407- 430 (2001)
    • (2001) J. ACM , vol.48 , Issue.3 , pp. 407-430
    • Manzini, G.1
  • 22
    • 16244377698 scopus 로고    scopus 로고
    • Word-based text compression using the Burrows-Wheeler transform
    • 22
    • 22. Moffat, A., Isal, R.Y.: Word-based text compression using the Burrows-Wheeler transform. Information Processing Management 41(5), 1175-1192 (2005)
    • (2005) Information Processing Management , vol.41 , Issue.5 , pp. 1175-1192
    • Moffat, A.1    Isal, R.Y.2
  • 23
    • 2442558876 scopus 로고    scopus 로고
    • Algorithms for delta compression and remote file synchronization
    • 23, Academic Press, London
    • 23. Suel, T., Memon, N.: Algorithms for delta compression and remote file synchronization. In: Lossless Compression Handbook. Academic Press, London (2002)
    • (2002) Lossless Compression Handbook
    • Suel, T.1    Memon, N.2
  • 24
    • 53349171747 scopus 로고    scopus 로고
    • Compressing file collections with a TSPbased approach
    • 24, Technical report, TR-CIS-2004-02, Polytechnic University 2004
    • 24. Trendafilov, D., Memon, N., Suel, T.: Compressing file collections with a TSPbased approach. Technical report, TR-CIS-2004-02, Polytechnic University (2004)
    • Trendafilov, D.1    Memon, N.2    Suel, T.3
  • 25
    • 35448929046 scopus 로고    scopus 로고
    • Compressing table data with column dependency
    • 25
    • 25. Vo, B.D., Vo, K.-P.: Compressing table data with column dependency. Theoretical Computer Science 387(3), 273-283 (2007)
    • (2007) Theoretical Computer Science , vol.387 , Issue.3 , pp. 273-283
    • Vo, B.D.1    Vo, K.-P.2


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