C. Timothy, I. H. Bell, and . Witten, The relationship between greedy parsing and symbolwise text compression, J. ACM, vol.41, issue.4, pp.708-724, 1994.

M. Cohn and R. Khazan, Parsing with suffix and prefix dictionaries, Proceedings of Data Compression Conference, DCC '96, pp.180-189, 1996.
DOI : 10.1109/DCC.1996.488323
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.7014

H. Thomas, . Cormen, E. Charles, . Leiserson, L. Ronald et al., Introduction to Algorithms, 2001.

M. Crochemore and T. Lecroq, Pattern-matching and text-compression algorithms, ACM Computing Surveys, vol.28, issue.1, pp.39-41, 1996.
DOI : 10.1145/234313.234331
URL : https://hal.archives-ouvertes.fr/hal-00620795

P. Ferragina, I. Nitto, and R. Venturini, On the Bit-Complexity of Lempel--Ziv Compression, SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pp.768-777, 2009.
DOI : 10.1137/120869511

A. Hartman and M. Rodeh, Optimal Parsing of Strings, pp.155-167, 1985.
DOI : 10.1007/978-3-642-82456-2_11

R. N. Horspool, The effect of non-greedy parsing in Ziv-Lempel compression methods, Proceedings DCC '95 Data Compression Conference, 1995.
DOI : 10.1109/DCC.1995.515520

J. Katajainen and T. Raita, An Approximation Algorithm for Space-optimal Encoding of a Text, The Computer Journal, vol.32, issue.3, pp.228-237, 1989.
DOI : 10.1093/comjnl/32.3.228

J. Katajainen and T. Raita, An analysis of the longest match and the greedy heuristics in text encoding, Journal of the ACM, vol.39, issue.2, pp.281-294, 1992.
DOI : 10.1145/128749.128751

T. Young, K. , and T. Kim, On-line optimal parsing in dictionary-based coding adaptive, Electronic Letters, vol.34, issue.11, pp.1071-1072, 1998.

T. Shmuel and . Klein, Efficient optimal recompression, Comput. J, vol.40, issue.23, pp.117-126, 1997.

S. , R. Kosaraju, and G. Manzini, Compression of low entropy strings with lempel?ziv algorithms, SIAM J. Comput, vol.29, issue.3, pp.893-911, 2000.

M. Mahoney, Large text compression benchmark: http://mattmahoney

C. Martelock, Rzm order-1 rolz compressor, 2008.

Y. Matias, N. Rajpoot, and S. Sahinalp, The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression, Journal of Experimental Algorithmics, vol.6, p.10, 2001.
DOI : 10.1145/945394.945404

Y. Matias and S. Sahinalp, On the optimality of parsing in dynamic dictionary based data compression http, 1998.

Y. Matias-nd-s-"-uleyman and C. Sahinalp, On the optimality of parsing in dynamic dictionary based data compression, SODA, pp.943-944, 1999.

G. , D. Penna, A. Langiu, F. Mignosi, and A. Ulisse, Optimal parsing in dictionary-symbolwise data compression schemes, 2006.

J. Ernst, H. S. Schuegraf, and . Heaps, A comparison of algorithms for data base compression by use of fragments as language elements, Information Storage and Retrieval, vol.10, pp.9-10309, 1974.

A. James, T. G. Storer, and . Szymanski, Data compression via textural substitution, J. ACM, vol.29, issue.4, pp.928-951, 1982.

G. John, C. Cleary-timothy, I. H. Bell, and . Witten, Text compression, 1990.

R. A. Wagner, Common phrases and minimum-space text storage, Communications of the ACM, vol.16, issue.3, pp.148-152, 1973.
DOI : 10.1145/361972.361982