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.