A. Amir, G. M. Landau, and E. Ukkonen, Online timestamped text indexing, Information Processing Letters, vol.82, issue.5, pp.253-259, 2002.
DOI : 10.1016/S0020-0190(01)00275-7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Arratia and M. S. Waterman, The Erdos-Renyi Strong Law for Pattern Matching with a Given Proportion of Mismatches, The Annals of Probability, vol.17, issue.3, pp.1152-1169, 1989.
DOI : 10.1214/aop/1176991262

T. C. Bell, J. G. Cleary, and I. H. Witten, Text compression, 1990.

C. Timothy, I. H. Bell, and . Witten, The relationship between greedy parsing and symbolwise text compression, Journal of the 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=

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, 2001.

M. Crochemore, C. Epifanio, A. Gabriele, and F. Mignosi, On the Suffix Automaton with Mismatches, CIAA, pp.144-156, 2007.
DOI : 10.1007/978-3-540-76336-9_15

URL : https://hal.archives-ouvertes.fr/hal-00620159

M. Crochemore and L. Giambruno, Alessio Langiu, Filippo Mignosi, and Antonio Restivo. Dictionary-symbolwise flexible parsing

M. Crochemore, L. Giambruno, A. Langiu, F. Mignosi, and A. Restivo, Dictionary-symbolwise flexible parsing Journal of Discrete Algorithms -IWOCA'10 Special Issue, 2011.

M. Crochemore and L. Ilie, Computing Longest Previous Factor in linear time and applications, Information Processing Letters, vol.106, issue.2, pp.75-80, 2008.
DOI : 10.1016/j.ipl.2007.10.006

URL : https://hal.archives-ouvertes.fr/hal-00619691

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

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

C. Epifanio, A. Gabriele, and F. Mignosi, Languages with Mismatches and an Application to Approximate Indexing, Proceedings of the 9th International Conference Developments in Language Theory (DLT05), pp.224-235, 2005.
DOI : 10.1007/11505877_20

M. Peter and . Fenwick, Symbol ranking text compression with shannon recodings, Journal of Universal Computer Science, vol.3, issue.2, pp.70-85, 1997.

P. Ferragina and G. Manzini, Indexing compressed text, Journal of the ACM, vol.52, issue.4, pp.552-581, 2005.
DOI : 10.1145/1082036.1082039

P. Ferragina, I. Nitto, and R. Venturini, On the bitcomplexity of Lempel-Ziv compression, SODA '09: Proceedings of 88

A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino, Indexing Structures for Approximate String Matching, Proc. of CIAC'03, pp.140-151, 2003.
DOI : 10.1007/3-540-44849-7_20

D. Gusfield, Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology, 1997.

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

S. Inenaga, A. Shinohara, M. Takeda, and S. Arikawa, Compact directed acyclic word graphs for a sliding window, SPIRE, pp.310-324, 2002.

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.

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.

A. Langiu, Optimal parsing in dictionary-symbolwise compression algorithms Master's thesis, 2008.

N. and J. Larsson, Extended application of suffix trees to data compression, Proceedings of Data Compression Conference, DCC '96, pp.190-199, 1996.
DOI : 10.1109/DCC.1996.488324

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, SODA, pp.943-944, 1999.

A. Joong-chae-na, C. S. Apostolico, K. Iliopoulos, and . Park, Truncated suffix trees and their application to data compression

D. Salomon, Data compression -The Complete Reference, 2007.

D. Salomon, Variable-length Codes for Data Compression, 2007.
DOI : 10.1007/978-1-84628-959-0

K. Sayood, Introduction to Data Compression, 1996.

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.

M. Senft, Suffix tree for a sliding window: An overview, Proceedings of WDS'05, Part 1, pp.41-46, 2005.

M. Senft and T. Dvo?ák, Sliding CDAWG Perfection, Proceedings of the 15th International Symposium on String Processing and Information Retrieval, SPIRE '08, pp.109-120, 2009.
DOI : 10.1007/978-3-540-89097-3_12

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

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, p.90, 2001.
DOI : 10.1002/9781118032770

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

A. Terry and . Welch, A technique for high-performance data compression, IEEE Computer, pp.8-19, 1984.