메뉴 건너뛰기




Volumn 5193 LNCS, Issue , 2008, Pages 696-707

An online algorithm for finding the longest previous factors

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 57749170920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_58     Document Type: Conference Paper
Times cited : (27)

References (27)
  • 2
    • 57749202831 scopus 로고    scopus 로고
    • Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
    • Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
  • 4
    • 57749185179 scopus 로고    scopus 로고
    • LZ factorization in less time and space
    • MCS Special Issue on Combinatorial Algorithms
    • Chen, G., Puglisi, S.J., Smyth, W.F.: LZ factorization in less time and space. Mathematics in Computer Science (MCS) Special Issue on Combinatorial Algorithms (2008)
    • (2008) Mathematics in Computer Science
    • Chen, G.1    Puglisi, S.J.2    Smyth, W.F.3
  • 5
    • 57749207862 scopus 로고    scopus 로고
    • Chen, G., Puglisi. S.J., Smyth. W.: Fast and practical algorithms for computing all the runs in a string. In: Ma. B., Zhang, K. (eds.) CPM 2007. LNCS. 4580, pp. 307-315. Springer. Heidelberg (2007)
    • Chen, G., Puglisi. S.J., Smyth. W.: Fast and practical algorithms for computing all the runs in a string. In: Ma. B., Zhang, K. (eds.) CPM 2007. LNCS. vol. 4580, pp. 307-315. Springer. Heidelberg (2007)
  • 7
    • 50249188365 scopus 로고    scopus 로고
    • Crochemore, M., Hie, L., Smyth, W.F.: A simple algorithm for computing the Lempel-Ziv factorization. In: DCC, pp. 482-488 (2008)
    • Crochemore, M., Hie, L., Smyth, W.F.: A simple algorithm for computing the Lempel-Ziv factorization. In: DCC, pp. 482-488 (2008)
  • 8
    • 84863859625 scopus 로고    scopus 로고
    • Opportunistic data structures with applications
    • Ferragina. P., Manzini. G.: Opportunistic data structures with applications. In: Proc. of FOCS (2000)
    • (2000) Proc. of FOCS
    • Ferragina, P.1    Manzini, G.2
  • 9
    • 33746034182 scopus 로고    scopus 로고
    • Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, 4009, pp. 36-48. Springer, Heidelberg (2006)
    • Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36-48. Springer, Heidelberg (2006)
  • 10
    • 38049088202 scopus 로고    scopus 로고
    • Fischer, J., Heun, V.: A new succinct representation of rmq-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang. G. (eds.) ESCAPE 2007. LNCS. 4614. Springer, Heidelberg (2007)
    • Fischer, J., Heun, V.: A new succinct representation of rmq-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang. G. (eds.) ESCAPE 2007. LNCS. vol. 4614. Springer, Heidelberg (2007)
  • 11
    • 57749177235 scopus 로고    scopus 로고
    • Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: AWOCA, pp. 26-35 (2003)
    • Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: AWOCA, pp. 26-35 (2003)
  • 13
    • 84956976999 scopus 로고    scopus 로고
    • Kasai. T., Lee, G., Arimura, H., Arikawa. S., Park. K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, 2089, pp. 181-192. Springer, Heidelberg (2001)
    • Kasai. T., Lee, G., Arimura, H., Arikawa. S., Park. K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol 2089, pp. 181-192. Springer, Heidelberg (2001)
  • 15
    • 0029712326 scopus 로고    scopus 로고
    • Extended application of suffix trees to data compression
    • Larsson, J.: Extended application of suffix trees to data compression. In: Proc. of DCC pp. 190-199 (1996)
    • (1996) Proc. of DCC , pp. 190-199
    • Larsson, J.1
  • 17
    • 37849007188 scopus 로고    scopus 로고
    • Lee, S., Park, K.: Dynamic rank-select structures with applications to run-length encoded texts. In: Ma, B., Zhang. K. (eds.) CPM 2007. LNCS, 4580, pp. 95-106. Springer, Heidelberg (2007)
    • Lee, S., Park, K.: Dynamic rank-select structures with applications to run-length encoded texts. In: Ma, B., Zhang. K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 95-106. Springer, Heidelberg (2007)
  • 19
    • 0027681165 scopus 로고    scopus 로고
    • Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. STAM J. Comput. 22(5), 935-948 (1993)
    • Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. STAM J. Comput. 22(5), 935-948 (1993)
  • 20
    • 0032666922 scopus 로고    scopus 로고
    • An improved data structure for cumulative probability tables
    • Moffat, A.: An improved data structure for cumulative probability tables. Software: Practice and Experience 29, 647-659 (1999)
    • (1999) Software: Practice and Experience , vol.29 , pp. 647-659
    • Moffat, A.1
  • 23
    • 84968866645 scopus 로고    scopus 로고
    • Sadakane, K.: Succinct representations of LCP information and improvements in the compressed suffi arrays. In: ACM-STAM SODA, pp. 225-232 (2002)
    • Sadakane, K.: Succinct representations of LCP information and improvements in the compressed suffi arrays. In: ACM-STAM SODA, pp. 225-232 (2002)
  • 25
    • 57749185615 scopus 로고    scopus 로고
    • Smyth, W.F.: http://www.cas.mcmaster.ca/~bill/strbings/
    • Smyth, W.F.1
  • 27
    • 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 23(3). 337-343 (1977)
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


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