-
1
-
-
0037418753
-
Collage system: a unifying framework for compressed pattern matching
-
Kida, T.; Matsumoto, T.; Shibata, Y.; Takeda, M.; Shinohara, A.; Arikawa, S. Collage system: a unifying framework for compressed pattern matching. Theoretical Computer Science 2003, 298, 253-272.
-
(2003)
Theoretical Computer Science
, vol.298
, pp. 253-272
-
-
Kida, T.1
Matsumoto, T.2
Shibata, Y.3
Takeda, M.4
Shinohara, A.5
Arikawa, S.6
-
2
-
-
0942279288
-
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
-
4
-
-
59049103692
-
Efficient Algorithms to Compute Compressed Longest Common Substrings and Compressed Palindromes
-
Matsubara, W.; Inenaga, S.; Ishino, A.; Shinohara, A.; Nakamura, T.; Hashimoto, K. Efficient Algorithms to Compute Compressed Longest Common Substrings and Compressed Palindromes. Theoretical Computer Science 2009, 410, 900-913.
-
(2009)
Theoretical Computer Science
, vol.410
, pp. 900-913
-
-
Matsubara, W.1
Inenaga, S.2
Ishino, A.3
Shinohara, A.4
Nakamura, T.5
Hashimoto, K.6
-
5
-
-
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. 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), 2009, pp. 529-540.
-
(2009)
Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
, pp. 529-540
-
-
Hermelin, D.1
Landau, G.M.2
Landau, S.3
Weimann, O.4
-
6
-
-
84859645349
-
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program
-
Australian Computer Society
-
Matsubara, W.; Inenaga, S.; Shinohara, A. Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. In Proc. 15th Computing: The Australasian Theory Symposium (CATS'09). Australian Computer Society, 2009, Vol. 94, CRPIT, pp. 19-28.
-
(2009)
Proc. 15th Computing: The Australasian Theory Symposium (CATS'09), CRPIT
, vol.94
, pp. 19-28
-
-
Matsubara, W.1
Inenaga, S.2
Shinohara, A.3
-
7
-
-
0002044093
-
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
-
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
-
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
-
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
-
-
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
-
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
-
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
-
14
-
-
0034226985
-
Universal lossless compression via multilevel pattern matching
-
Kieffer, J. C.; Yang, E.-H.; Nelson, G. J.; Cosman, P. C. Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory 2000, 46, 1227-1245.
-
(2000)
IEEE Transactions on Information Theory
, vol.46
, pp. 1227-1245
-
-
Kieffer, J.C.1
Yang, E.-H.2
Nelson, G.J.3
Cosman, P.C.4
-
15
-
-
18544376055
-
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
-
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
-
17
-
-
77950238328
-
A Space-Saving Approximation Algorithm for Grammar-Based Compression
-
Sakamoto, H.; Maruyama, S.; Kida, T.; Shimozono, S. A Space-Saving Approximation Algorithm for Grammar-Based Compression. IEICE Trans. on Information and Systems 2009, E92-D, 158-165.
-
(2009)
IEICE Trans. on Information and Systems
, vol.E92-D
, pp. 158-165
-
-
Sakamoto, H.1
Maruyama, S.2
Kida, T.3
Shimozono, S.4
-
18
-
-
85041120542
-
Context-Sensitive Grammar Transform: Compression and Pattern Matching
-
Springer-Verlag
-
Maruyama, S.; Tanaka, Y.; Sakamoto, H.; Takeda, M. Context-Sensitive Grammar Transform: Compression and Pattern Matching. In Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE'08). Springer-Verlag, 2008, Vol. 5280, Lecture Notes in Computer Science, pp. 27-38.
-
(2008)
Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE'08), Lecture Notes in Computer Science
, vol.5280
, pp. 27-38
-
-
Maruyama, S.1
Tanaka, Y.2
Sakamoto, H.3
Takeda, M.4
-
19
-
-
84982036565
-
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
-
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
-
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
-
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
-
25
-
-
34547638395
-
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
-
Nakamura, R.; Bannai, H.; Inenaga, S.; Takeda, M. Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. In Proc. Data Compression Conference '07 (DCC'07). IEEE Computer Society, 2007, pp. 123-132.
-
(2007)
Proc. Data Compression Conference '07 (DCC'07). IEEE Computer Society
, pp. 123-132
-
-
Nakamura, R.1
Bannai, H.2
Inenaga, S.3
Takeda, M.4
-
26
-
-
0142218944
-
Linear-time off-line text compression by longest-first substitution
-
Springer-Verlag
-
Inenaga, S.; Funamoto, T.; Takeda, M.; Shinohara, A. Linear-time off-line text compression by longest-first substitution. In Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE'03). Springer-Verlag, 2003, Vol. 2857, Lecture Notes in Computer Science, pp. 137-152.
-
(2857)
Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE'03), Lecture Notes in Computer Science
, vol.2003
, pp. 137-152
-
-
Inenaga, S.1
Funamoto, T.2
Takeda, M.3
Shinohara, A.4
-
29
-
-
0001704377
-
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
-
30
-
-
84948971495
-
Sparse Suffix Trees
-
Springer-Verlag
-
Kärkkäinen, J.; Ukkonen, E. Sparse Suffix Trees. In Proc. 2nd Annual International Computing and Combinatorics Conference (COCOON'96). Springer-Verlag, 1996, Vol. 1090, Lecture Notes in Computer Science, pp. 219-230.
-
(1090)
Proc. 2nd Annual International Computing and Combinatorics Conference (COCOON'96), Lecture Notes in Computer Science
, vol.1996
, pp. 219-230
-
-
Kärkkäinen, J.1
Ukkonen, E.2
-
31
-
-
0000559577
-
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
-
32
-
-
84869200621
-
Solving the String Stastistics Problem in Time O(n log n)
-
Springer-Verlag
-
Brødal, G. S.; Lyngsø, R. B.; Östlin, A.; Pedersen, C. N. S. Solving the String Stastistics Problem in Time O(n log n). In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP'02). Springer-Verlag, 2002, Vol. 2380, Lecture Notes in Computer Science, pp. 728-739.
-
(2002)
Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP'02), Lecture Notes in Computer Science
, vol.2380
, pp. 728-739
-
-
Brødal, G.S.1
Lyngsø, R.B.2
Östlin, A.3
Pedersen, C.N.S.4
|