Using static suffix array in dynamic application: Case of text compression by longest first substitution (CROSBI ID 209682)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Ristov, Strahil ; Korenčić, Damir
engleski
Using static suffix array in dynamic application: Case of text compression by longest first substitution
Over the last decade, enhanced suffix arrays (ESA) have replaced suffix trees in many applications. Algorithms based on ESAs require less space, while allowing the same time efficiency as those based on suffix trees. However, this is only true when a suffix structure is used as a static index. Suffix trees can be updated faster than suffix arrays, which is a clear advantage in applications that require dynamic indexing. We show that for some dynamic applications a suffix array and the derived LCP-interval tree can be used in such a way that the actual index updates are not necessary. We demonstrate this in the case of grammar text compression with longest first substitution and provide the source code. The proposed algorithm has O(N2) worst case time complexity but runs in O(N) time in practice.
Algorithms; Enhanced suffix array; Grammar text compression; Longest first substitution; Text index update
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano