NJ
The neighbor-joining algorithm is commonly applied with distance tree building, regardless of the optimization criterion. The fully resolved tree is ‘‘decomposed’’ from a fully unresolved ‘‘star’’ tree by successively inserting branches between a pair of closest (actually, most isolated) neighbors and the remaining terminals in the tree. The closest neighbor pair is then consolidated, effectively reforming a star tree, and the process is
repeated. The method is
comparatively rapid.
NJ 在距離建樹中經常會用到，不會理會使用什麼樣的優化標準。解析出的進化樹是通過對完全沒有解析出的 “星型” 進化樹進行 “分解” 得到，分解的步驟是連續不斷地在最接近（實際上，是最孤立的）的序列對中插入樹枝，而保留進化樹的終端。最接近的序列對被鞏固了，而 “星型” 進化樹被改善了，這個過程將不斷重複。
Neighbor Joining (NJ)