-
1
-
-
2442516025
-
The level ancestor problem simplified
-
Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5-12 (2004)
-
(2004)
Theor. Comput. Sci.
, vol.321
, Issue.1
, pp. 5-12
-
-
Bender, M.A.1
Farach-Colton, M.2
-
2
-
-
0028407484
-
Finding level-ancestors in trees
-
Berkman, O., Vishkin, U.: Finding level-ancestors in trees. J. Comput. System Sci. 48(2), 214-230 (1994)
-
(1994)
J. Comput. System Sci.
, vol.48
, Issue.2
, pp. 214-230
-
-
Berkman, O.1
Vishkin, U.2
-
3
-
-
84856433861
-
Self-indexed grammar-based compression
-
Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fundamenta Informaticae 111(3), 313-337 (2011)
-
(2011)
Fundamenta Informaticae
, vol.111
, Issue.3
, pp. 313-337
-
-
Claude, F.1
Navarro, G.2
-
4
-
-
0942266549
-
A subquadratic sequence alignment algorithm for unrestricted scoring matrices
-
Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J. Comput. 32(6), 1654-1673 (2003)
-
(2003)
SIAM J. Comput.
, vol.32
, Issue.6
, pp. 1654-1673
-
-
Crochemore, M.1
Landau, G.M.2
Ziv-Ukelson, M.3
-
5
-
-
85032035961
-
Finding Level-Ancestors in Dynamic Trees
-
Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. Springer, Heidelberg
-
Dietz, P.: Finding Level-Ancestors in Dynamic Trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 32-40. Springer, Heidelberg (1991)
-
(1991)
LNCS
, vol.519
, pp. 32-40
-
-
Dietz, P.1
-
6
-
-
71449088969
-
Compressing and indexing labeled trees, with applications
-
Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57(1) (2009)
-
(2009)
J. ACM
, vol.57
, Issue.1
-
-
Ferragina, P.1
Luccio, F.2
Manzini, G.3
Muthukrishnan, S.4
-
7
-
-
80052794470
-
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
-
Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. Springer, Heidelberg
-
Gawrychowski, P.: Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 421-432. Springer, Heidelberg (2011)
-
(2011)
LNCS
, vol.6942
, pp. 421-432
-
-
Gawrychowski, P.1
-
8
-
-
26944445815
-
Real-time traversal in grammar-based compressed files
-
Ga̧sieniec, L., Kolpakov, R., Potapov, I., Sant, P.: Real-time traversal in grammar-based compressed files. In: Proc. DCC 2005, p. 458 (2005)
-
(2005)
Proc. DCC 2005
, pp. 458
-
-
Ga̧sieniec, L.1
Kolpakov, R.2
Potapov, I.3
Sant, P.4
-
9
-
-
80053998246
-
Fast q-gram Mining on SLP Compressed Strings
-
Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. Springer, Heidelberg
-
Goto, K., Bannai, H., Inenaga, S., Takeda, M.: Fast q-gram Mining on SLP Compressed Strings. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 278-289. Springer, Heidelberg (2011)
-
(2011)
LNCS
, vol.7024
, pp. 278-289
-
-
Goto, K.1
Bannai, H.2
Inenaga, S.3
Takeda, M.4
-
10
-
-
84880203708
-
A unified algorithm for accelerating edit-distance computation via text-compression
-
Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: Proc. STACS 2009, pp. 529-540 (2009)
-
(2009)
Proc. STACS 2009
, pp. 529-540
-
-
Hermelin, D.1
Landau, G.M.2
Landau, S.3
Weimann, O.4
-
12
-
-
84863088262
-
-
a preliminary version appeared in
-
a preliminary version appeared in PSC 2009
-
PSC 2009
-
-
-
13
-
-
33750232966
-
Linear work suffix array construction
-
Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM 53(6), 918-936 (2006)
-
(2006)
Journal of the ACM
, vol.53
, Issue.6
, pp. 918-936
-
-
Kärkkäinen, J.1
Sanders, P.2
Burkhardt, S.3
-
14
-
-
0012491117
-
An efficient pattern-matching algorithm for strings with short descriptions
-
Karpinski, M., Rytter, W., Shinohara, A.: An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing 4, 172-186 (1997)
-
(1997)
Nordic Journal of Computing
, vol.4
, pp. 172-186
-
-
Karpinski, M.1
Rytter, W.2
Shinohara, A.3
-
15
-
-
84956976999
-
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
-
Amir, A., Landau, G.M. (eds.) CPM 2001. Springer, Heidelberg
-
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)
-
(2001)
LNCS
, vol.2089
, pp. 181-192
-
-
Kasai, T.1
Lee, G.2
Arimura, H.3
Arikawa, S.4
Park, K.5
-
17
-
-
0032647886
-
Offline dictionary-based compression
-
IEEE Computer Society
-
Larsson, N.J., Moffat, A.: Offline dictionary-based compression. In: Proc. DCC 1999, pp. 296-305. IEEE Computer Society (1999)
-
(1999)
Proc. DCC 1999
, pp. 296-305
-
-
Larsson, N.J.1
Moffat, A.2
-
18
-
-
0027961697
-
Compression by induction of hierarchical grammars
-
Nevill-Manning, C.G., Witten, I.H., Maulsby, D.L.: Compression by induction of hierarchical grammars. In: Proc. DCC 1994, pp. 244-253 (1994)
-
(1994)
Proc. DCC 1994
, pp. 244-253
-
-
Nevill-Manning, C.G.1
Witten, I.H.2
Maulsby, D.L.3
-
19
-
-
0038238644
-
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. Theor. Comput. Sci. 302(1-3), 211-222 (2003)
-
(2003)
Theor. Comput. Sci.
, vol.302
, Issue.1-3
, pp. 211-222
-
-
Rytter, W.1
-
20
-
-
84912109348
-
Speeding Up Pattern Matching by Text Compression
-
Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. Springer, Heidelberg
-
Shibata, Y., Kida, T., Fukamachi, S., Takeda, M., Shinohara, A., Shinohara, T., Arikawa, S.: Speeding Up Pattern Matching by Text Compression. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 306-315. Springer, Heidelberg (2000)
-
(2000)
LNCS
, vol.1767
, pp. 306-315
-
-
Shibata, Y.1
Kida, T.2
Fukamachi, S.3
Takeda, M.4
Shinohara, A.5
Shinohara, T.6
Arikawa, S.7
-
22
-
-
0020190931
-
Data compression via textual substitution
-
Storer, J., Szymanski, T.: Data compression via textual substitution. Journal of the ACM 29(4), 928-951 (1982)
-
(1982)
Journal of the ACM
, vol.29
, Issue.4
, pp. 928-951
-
-
Storer, J.1
Szymanski, T.2
-
23
-
-
0021439618
-
A technique for high performance data compression
-
Welch, T.A.: A technique for high performance data compression. IEEE Computer 17, 8-19 (1984)
-
(1984)
IEEE Computer
, vol.17
, pp. 8-19
-
-
Welch, T.A.1
-
24
-
-
0017493286
-
A universal algorithm for sequential data compression
-
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory IT-23(3), 337-349 (1977)
-
(1977)
IEEE Transactions on Information Theory
, vol.IT-23
, Issue.3
, pp. 337-349
-
-
Ziv, J.1
Lempel, A.2
-
25
-
-
0018019231
-
Compression of individual sequences via variable-length coding
-
Ziv, J., Lempel, A.: Compression of individual sequences via variable-length coding. IEEE Transactions on Information Theory 24(5), 530-536 (1978)
-
(1978)
IEEE Transactions on Information Theory
, vol.24
, Issue.5
, pp. 530-536
-
-
Ziv, J.1
Lempel, A.2
|