title: Comparing trees with different leaf sets (different number and label of leaf nodes)
body: <p>I have hierarchical data from file/ folder structures which i use to build trees. I am now trying to compare these trees with random ones and amongst themselves. </p>
  
  <p>To compare to random trees I can preserve the number and label of the leaf nodes and use traditional tree distance metrics (For instance Robinson-Foulds distance). Nonetheless to compare different trees from different data ( with different number of leaves and labels ) I have no idea which metric/ algorithm to use. Any suggestions?</p>
  
  <p>thanks!</p>
  
  <p>PS- the goal with the comparison would be to establish how similar is the topology between these trees and see which clusters may exist (and hence add some piece of evidence on the thoughts of the generating mechanisms behind the folder structure).</p>