(Moschitti, 2006), where p is the largest subsequence of children that we want to consider and ρ is the maximal outdegree observed in the two trees.
the average running time tends to be linear for natural language syntactic trees (Moschitti, 2006).