A. , A. V. Hopcroft, J. E. And, U. , and J. D. , The Design and Analysis of Computer Algorithms, 1974.

B. and P. , A survey on tree edit distance and related problems, Theoretical Computer Science, vol.337, pp.217-239, 2005.

B. , P. Gørtz, I. L. Landau, G. M. And, W. et al., Tree compression with top trees, 40th International Colloquium on Automata, Languages and Programming, vol.243, pp.166-177, 2015.

B. , M. Lohrey, M. Maneth, S. And, N. et al., XML compression via directed acyclic graphs, Theory of Computing Systems, pp.1-50, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00865211

B. , P. Grohe, M. And, K. , and C. , Path queries on compressed XML, Proceedings of the 29th International Conference on Very Large Data Bases, pp.141-152, 2003.

B. , G. Lohrey, M. And, M. , and S. , Efficient memory representation of xml document trees, Inf. Syst, vol.33, pp.456-474, 2008.

C. and J. M. , Statistical Models in S. Wadsworth & Brooks/Cole, 1992, ch. Linear models

C. and S. S. , Comparing hierarchical data in external memory, Proceedings of the 25th International Conference on Very Large Data Bases, pp.90-101, 1999.

C. and J. , On the number of points in regular discrete simplex, IEEE Transactions on Information Theory, vol.17, pp.211-212, 1971.

D. , P. J. Sethi, R. And, T. , and R. E. , Variations on the common subexpression problem, J. ACM, vol.27, pp.758-771, 1980.

F. , P. And, G. , and C. , An edit distance between quotiented trees, Algorithmica, vol.36, pp.1-39, 2003.

F. , P. And, S. , and R. A. Combinatorics, , 2009.

F. , M. Grohe, M. And, K. , and C. , Query evaluation on compressed trees, Logic in Computer Science, 2003. Proceedings. 18th Annual IEEE Symposium on, pp.188-197, 2003.

G. , C. And, F. , and P. , Quantifying the degree of self-nestedness of trees. Application to the structural analysis of plants, IEEE TCBB, vol.7, issue.4, pp.688-703, 2010.

G. and R. , Subtree isomorphism is in dlog for nested trees, International Journal of Foundations of Computer Science, vol.07, pp.161-167, 1996.

L. , M. And, M. , and S. , The complexity of tree automata and xpath on grammar-compressed trees, Theor. Comput. Sci, vol.363, pp.196-210, 2006.

L. , M. Maneth, S. And, M. , and R. , Tree structure compression with repair, Data Compression Conference (DCC), pp.353-362, 2011.

S. and S. , XML compression techniques: A survey and comparison, Journal of Computer and System Sciences, vol.75, issue.5, pp.303-322, 2009.

B. A. Shapiro, Z. And, and K. , Comparing multiple rna secondary structures using tree comparisons, Bioinformatics, vol.6, pp.309-318, 1990.
DOI : 10.1093/bioinformatics/6.4.309

T. , E. And, T. , and K. , The tree-to-tree editing problem, International Journal of Pattern Recognition and Artificial Intelligence, vol.02, pp.221-240, 1988.

T. and R. E. , Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.

Z. and K. , A constrained edit distance between unordered labeled trees, Algorithmica, vol.15, pp.205-222, 1996.