A comparison of 'Closest-neighbour-interchange' and 'Nearest-neighbour-interchnage' algorithms

Question

[mdsiddra]

I have been using different tools for reconstrucing a phylogenetic tree from data file. The tools provide different searching algorithms to be chosen for searching the best tree from data file. 'Closest-neighbour-interchange' (CNI) and 'Nearest-neighbour-interchnage' (NNI) are among those.

I want to understand, what makes the two algorithms, 'Closest-neighbour-interchange' and 'Nearest-neighbour-interchnage' different from each other?? How do the two search differently? What is the preference of chosing any of the algorithm??

It would also be helpful if I can get comparative/ or any literature data for this.

[Jean-Karim Heriche]

On the face of it, given that closest is synonym to nearest, the two algorithms should be the same. However, there may be implementation details that make the tools work differently. The question can't be answered without you indicating which tools you are using or pointing to a description of the two algorithms and their implementation.

[mdsiddra]

Oh sorry for that, I forgot to mention that I was talking about MEGA software. And I think I have found my answer in suggestions by other.

Thankyou for your helpful response.

Answer 1

[h.mon]

I am not 100% sure, but I think some old version of MEGA used 'Closest-neighbour-interchange'. You won't find this nowadays, the name of the algorithm is 'Nearest-neighbour-interchnage', MEGA used 'Closest-neighbour-interchange' as synonymous to 'Nearest-neighbour-interchnage', but changed to 'Nearest-neighbour-interchnage' in more recent versions.

[mdsiddra]

Yes , I guess this is right, I have compared the MEGA older and newer versions and I have found the same you have suggested. Thankyou for this helpful guidance.