Incremental Data Compression (Extended Abstract)

this paper can be used in the construction of an algorithm for coding a tree with respect to a dictionary of trees. This paper is organised as follows. Section 2 describes the edit model and the induced form of incremental algorithms. Section 3 specifies the problem of coding a text with respect to a dictionary, and Section 4 sketches a derivation of an incremental algorithm for this problem. 2 Incremental algorithms and the edit mode