1. Aho, A., Hirschberg, D., Ullman, J.: Bounds on the Complexity of the Longest Common Subsequence Problem. Journal of the Association for Computing Machinery 23(1), 1–12 (1976)
2. Bertino, E., Guerrini, G., Mesiti, M., Rivara, I., Tavella, C.: Measuring the Structural Similarity among XML Documents and DTDs. Technical Report, University of Genova (2002),
http://www.disi.unige.it/person/MesitiM
3. Bertino, E., Guerrini, G., Mesiti, M.: A Matching Algorithm for Measuring the Structural Similarity between an XML Documents and a DTD and Its Applications. Computer Science 29, 23–46 (2004)
4. Chawathe, S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change Detection in Hierarchically Structured Information. In: Proc. of the ACM Int. Conf. on Management of Data (SIGMOD), Montreal, Quebec, Canada (1996)
5. Chawathe, S.: Comparing Hierarchical Data in External Memory. In: Proceedings of the Twenty-fth Int. Conf. on Very Large Data Bases, pp. 90–101(1999)