Abstract 

 

Ordered trees are trees in which the left to right order among siblings is important. Trees shows repetitions in their intern structure, using this redundancy, this paper seek to reduce the complexity of tree structures by merging its isomorphic subtrees producing a directed acyclic graph without losing data.

 

 

 Télécharger l'article : Ordered Tree Compression