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=10.1.1.22.7955
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
Text compression, 1990. ,
The relationship between greedy parsing and symbolwise text compression, Journal of the ACM, vol.41, issue.4, pp.708-724, 1994. ,
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
Introduction to Algorithms, 2001. ,
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
Alessio Langiu, Filippo Mignosi, and Antonio Restivo. Dictionary-symbolwise flexible parsing ,
Dictionary-symbolwise flexible parsing Journal of Discrete Algorithms -IWOCA'10 Special Issue, 2011. ,
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
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
Optimal parsing in dictionary-symbolwise data compression schemes, 2006. ,
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
Symbol ranking text compression with shannon recodings, Journal of Universal Computer Science, vol.3, issue.2, pp.70-85, 1997. ,
Indexing compressed text, Journal of the ACM, vol.52, issue.4, pp.552-581, 2005. ,
DOI : 10.1145/1082036.1082039
On the bitcomplexity of Lempel-Ziv compression, SODA '09: Proceedings of 88 ,
Indexing Structures for Approximate String Matching, Proc. of CIAC'03, pp.140-151, 2003. ,
DOI : 10.1007/3-540-44849-7_20
Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology, 1997. ,
Optimal Parsing of Strings, Combinatorial Algorithms on Words, pp.155-167, 1985. ,
DOI : 10.1007/978-3-642-82456-2_11
Compact directed acyclic word graphs for a sliding window, SPIRE, pp.310-324, 2002. ,
On-line optimal parsing in dictionary-based coding adaptive, Electronic Letters, vol.34, issue.11, pp.1071-1072, 1998. ,
Compression of low entropy strings with Lempel?Ziv algorithms, SIAM J. Comput, vol.29, issue.3, pp.893-911, 2000. ,
Optimal parsing in dictionary-symbolwise compression algorithms Master's thesis, 2008. ,
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
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
On the optimality of parsing in dynamic dictionary based data compression, SODA, pp.943-944, 1999. ,
Truncated suffix trees and their application to data compression ,
Data compression -The Complete Reference, 2007. ,
Variable-length Codes for Data Compression, 2007. ,
DOI : 10.1007/978-1-84628-959-0
Introduction to Data Compression, 1996. ,
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. ,
Suffix tree for a sliding window: An overview, Proceedings of WDS'05, Part 1, pp.41-46, 2005. ,
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
Data compression via textural substitution, J. ACM, vol.29, issue.4, pp.928-951, 1982. ,
Average Case Analysis of Algorithms on Sequences, p.90, 2001. ,
DOI : 10.1002/9781118032770
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 technique for high-performance data compression, IEEE Computer, pp.8-19, 1984. ,