Neighbor-net

<p>NeighborNet is an algorithm for constructing <a href="/facts/Phylogenetic_network/v5VWJ9nU">phylogenetic networks</a> which is loosely based on the <a href="/facts/Neighbor_joining/Yld9VDz5">neighbor joining</a> algorithm. Like neighbor joining, the method takes a <a href="/facts/Distance_matrix/2ptk07Y7">distance matrix</a> as input, and works by agglomerating clusters. However, the NeighborNet algorithm can lead to collections of clusters which overlap and do not form a <a href="/facts/Hierarchy_(mathematics)/bpcv4UuB">hierarchy</a>, and are represented using a type of phylogenetic network called a <a href="/facts/Split_graph/xsUF1TFT">splits graph</a>. If the distance matrix satisfies the <a href="/facts/Kalmanson_combinatorial_conditions/AQEVVtg4">Kalmanson combinatorial conditions</a> then Neighbor-net will return the corresponding circular ordering. The method is implemented in the <a href="/facts/SplitsTree/N07SJMs9">SplitsTree</a> and <a href="/facts/R_(programming_language)/LSrkr8K8">R</a>/Phangorn packages.
</p><p>Examples of the application of Neighbor-net can be found in virology, horticulture, dinosaur genetics, <a href="/facts/Quantitative_comparative_linguistics/tadU30RN">comparative linguistics</a>, and archaeology.
</p>

Neighbor-net open-in-new

Neighbor-net