Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: Re: Distance among trees

by cacharbe (Curate)
on Nov 19, 2001 at 21:41 UTC ( [id://126313]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Distance among trees
in thread Distance among trees

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.

Replies are listed 'Best First'.
Re: Re: Re: Re: Distance among trees
by jmerelo (Sexton) on Nov 19, 2001 at 23:47 UTC
    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?
      Ask These Guys. If anyone knows, it's the people from the "Journal of Graph Algorithms and Applications".

      C-.

Re: Re: Re: Re: Distance among trees
by jmerelo (Sexton) on Nov 20, 2001 at 20:59 UTC
    Not exactly what I was looking for; looks like a tree construction method.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://126313]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2024-04-25 07:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found