Choosing word occurrences for the smallest grammar problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6031 LNCS, Issue , 2010, Pages 154-165

  Carrascosa, Rafael ^a   Coste, François ^b   Gallé, Matthias ^b   Infante Lopez, Gabriel ^a,c  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

^b INRIA   (France)

^c Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

IN-FIELD; KOLMOGOROV COMPLEXITY; OFF-LINE ALGORITHM; PATTERN DISCOVERY; SEARCH SPACES; SMALLEST GRAMMAR PROBLEM; STATE-OF-THE-ART ALGORITHMS;

ALGORITHMS; CONTEXT FREE GRAMMARS; DATA COMPRESSION; GLOBAL OPTIMIZATION; LINGUISTICS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77953789715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13089-2_13     Document Type: Conference Paper

References (21)

1. Apostolico, A., Lonardi, S.: Off-line compression by greedy textual substitution. Proceedings of the IEEE (January 2000)
2. Arnold, R., Bell, T.: A corpus for the evaluation of lossless compression algorithms. In: Data Compression Conference, Washington, DC, USA, p. 201. IEEE Computer Society, Los Alamitos (1997)
3. Bentley, J., McIlroy, D.: Data compression using long common strings. In: Data Compression Conference, pp. 287-295 (March 1999)
4. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Transactions on Information Theory 51(7), 2554-2576 (2005)
5. Evans, S.C., Kourtidis, A., Markham, T., Miller, J.: MicroRNA target detection and analysis for genes related to breast cancer using MDLcompress. EURASIP Journal on Bioinformatics and Systems Biology (3) (2007)
6. Kieffer, J., Yang, E.H.: Grammar-based codes: a new class of universal lossless source codes. IEEE Transactions on Information Theory 46 (2000)
7. Klein, D.: The Unsupervised Learning of Natural Language Structure. PhD thesis, University of Stanford (2005)
8. Lanctot, J.K., Li, M., Yang, E.H.: Estimating DNA sequence entropy. In: ACMSIAM Symposium on Discrete Algorithms, pp. 409-418 (January 2000)
9. Larsson, N., Moffat, A.: Off-line dictionary-based compression. Proceedings of the IEEE 88(11), 1722-1732 (2000)
10. Marcken, C.D.: Unsupervised language acquisition. PhD thesis, Massachusetts Institute of Technology (January 1996)
11. Nakamura, R., Inenaga, S., Bannai, H., Funamoto, T., Takeda, M., Shinohara, A.: Linear-time text compression by longest-first substitution. Algorithms 2(4), 1429-1448 (2009)
12. Nevill-Manning, C., Witten, I.: On-line and off-line heuristics for inferring hierarchies of repetitions in sequences. In: Data Compression Conference, pp. 1745-1755. IEEE, Los Alamitos (2000)
13. Nevill-Manning, C.G.: Inferring Sequential Structure. PhD thesis, University of Waikato (1996)
14. Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research 7 (January 1997)
15. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science 302(1-3), 211-222 (2003)
16. Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Inf. Comput. 97(1), 23-60 (1992)
17. Sakamoto, H., Maruyama, S., Kida, T., Shimozono, S.: A space-saving approximation algorithm for grammar-based compression. IEICE Transactions 92-D(2), 158-165 (2009)
18. Schuegraf, E.J., Heaps, H.S.: A comparison of algorithms for data base compression by use of fragments as language elements. Information Storage and Retrieval 10, 309-319 (1974)
19. Wolff, J.: An algorithm for the segmentation of an artificial language analogue. British Journal of Psychology 66 (1975)
20. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337-343 (1977)
21. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530-536 (1978)