Entering edit mode

4.8 years ago

mi.aghajohari
•
0

What is the goal of neighbour Joining algorithm?
First assume I have a distance matrix ** D**. I will run neighbour joining algorithm on this matrix.

question number 1: Are the distances between the vertices exactly the same as distance matrix ** D** I provided?

question number 2: Why to set the distance between vertex **f** and newly emerged vertex **u** from joining **u** and **v** I should use this formula?

I think if **f** and **g** are neighbour vertices so every **(d(f, k)-d(g,k)+d(f, g))/2** should return **d(f, u)**. Why I am wrong?
I think I am thinking about this algorithm totally wrong.

Looks like an assignment question.

No it's not an assignment. I am able to implement the algorithm which is my assignment to build the tree . These are the actual questions I have about this algorithm in order to find the core meaning of this algorithm and these questions are raised by my endeavour's in order to get the intuition behind the algorithm. I am sorry of the question is phrased as it's an assignment which I want to find the answer without thinking.