Compact Directed Acyclic Word Graphs for a Sliding Window
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Truncated suffix trees and their application to data compression
Theoretical Computer Science
Compact directed acyclic word graphs for a sliding window
Journal of Discrete Algorithms - SPIRE 2002
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
Enhanced code density of embedded CISC processors with echo technology
CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Comparative n-gram analysis of whole-genome protein sequences
HLT '02 Proceedings of the second international conference on Human Language Technology Research
An online PPM prediction model for web prefetching
Proceedings of the 9th annual ACM international workshop on Web information and data management
Measuring the structural similarity of semistructured documents using entropy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An Online Algorithm for Finding the Longest Previous Factors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Analysis and reduction of data spikes in thin client computing
Journal of Parallel and Distributed Computing
Online granular prediction model for web prefetching
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
On-Line linear-time construction of word suffix trees
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On-line suffix tree construction with reduced branching
Journal of Discrete Algorithms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
A practical scheme for maintaining an index for a sliding window in optimal time and space, by use of a suffix tree, is presented. The index supports location of the longest matching substring in time proportional to the length of the match. The total time for build and update operations is proportional to the size of the input. The algorithm, which is simple and straightforward, is presented in detail. The most prominent lossless data compression scheme, when considering compression performance, is prediction by partial matching with unbounded context lengths (PPM). However, previously presented algorithms are hardly practical, considering their extensive use of computational resources. We show that our scheme can be applied to PPM-style compression, obtaining an algorithm that runs in linear time, and in space bounded by an arbitrarily chosen window size. Application to Ziv-Lempel (1977) compression methods is straightforward and the resulting algorithm runs in linear time.