-
1
-
-
3242889975
-
Replacing suffix trees with enhanced suffix arrays
-
Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2(1), 53-86 (2004)
-
(2004)
Journal of Discrete Algorithms
, vol.2
, Issue.1
, pp. 53-86
-
-
Abouelhoda, M.I.1
Kurtz, S.2
Ohlebusch, E.3
-
2
-
-
57749202831
-
-
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)
-
-
-
-
3
-
-
34250206975
-
Compressed indexes for dynamic text collections
-
Chan, H., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3(2), 21 (2007)
-
(2007)
ACM Transactions on Algorithms
, vol.3
, Issue.2
, pp. 21
-
-
Chan, H.1
Hon, W.K.2
Lam, T.W.3
Sadakane, K.4
-
4
-
-
57749185179
-
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
-
-
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
-
-
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
-
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
-
-
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
-
-
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
-
-
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)
-
-
-
-
12
-
-
0002155190
-
New indices for text: PAT trees and PAT arrays
-
Gonnet, G.H., Baeza-Yates, R., Snider, T.: New indices for text: PAT trees and PAT arrays. Information Retrieval: Algorithms and Data Structures, 66-82 (1992)
-
(1992)
Information Retrieval: Algorithms and Data Structures
, pp. 66-82
-
-
Gonnet, G.H.1
Baeza-Yates, R.2
Snider, T.3
-
13
-
-
84956976999
-
-
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
-
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
-
-
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
-
-
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
-
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
-
-
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
-
-
Smyth, W.F.: http://www.cas.mcmaster.ca/~bill/strbings/
-
-
-
Smyth, W.F.1
-
27
-
-
0017493286
-
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
|