The q-Gram Distance for Ordered Unlabeled Trees

This document denotes the typos in the following paper: N. Ohkura, K. Hirata, T. Kuboyama, M. Harao: The q-Gram Distance for Ordered Unlabeled Trees, Proc. 8th International Conference on Discover Science (DS2005), LNAI, Springer-Verlag, 2005 (to appear). 1 Section 2, the First Paragraph Please replace the first paragraph with the following statements. A tree is a connected graph without cycles. A rooted tree is a tree with one node r chosen as its root . For a tree T = (V, E), we sometimes denote v ∈ T instead of v ∈ V , and |T | instead of |V |. 2 Section 4, Figure 5 In Figure 5 (the algorithm LinearEnumGram), please replace the line 10: if 0 ≤ d − q + 1 + 2k ≤ q then with the following statement: if k ≤ d − q + 1 + 2k ≤ max D then 3 Section 4, the Proof of Theorem 3 Please replace the statement in the second paragraph: By Lemma 1 and the definition of count [d], (j, k) ∈ count [d] implies that d and j are the depth of the left and right leaves of Pk, respectively. with the following statements. By Lemma 1 and the definition of count [d], (j, k) ∈ count [d] implies that d and j are the depth of the right and left leaves of Pk, respectively.