Already followed those leads, even emailed the guy. Looks promising,
but uses its own version of trees, creates "bipartition" of them,
and does not contain a detailed explanation of the algorithm. I could
try and glean it by following the code, but I'm not sure
it's worth the while. | [reply] |
| [reply] |
Not exactly what I was looking for. That's _another_ Robinson-Foulds algorithm,
not for tree distances.
I am not sure I want RF algorithm; looks like it's used for taxonomic distances,
but I'm looking for something similar to the insertion-and-deletion
metric for strings, but applied to trees. Does that exist?
| [reply] |
Not exactly what I was looking for; looks like a tree construction method.
| [reply] |