Looks like you're going to have to find a copy of "Lecture notes in mathematics" --Springer-Verlag, Germany(1979) to find out their proposed algorithm (or one of Foulds' other books, and he seems to have a few), but I found a text description of it here, pg. 4, and a subsequent discussion on the "Deltahedron Method" here, which does give an algorithm, but doesn't necessarily describe it as Foulds'. Hope that helps, C-. Update: After reading the Caccetta/Kusumah text, theirs might be a more interesting algorithm to attempt implementing if you are going to start from scratch. | [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] |
Ask These Guys. If anyone knows, it's the people from the "Journal of Graph Algorithms and Applications".
C-.
| [reply] |
Not exactly what I was looking for; looks like a tree construction method.
| [reply] |
