Neighbor-net
NeighborNet is an algorithm for constructing phylogenetic networks which is loosely based on the neighbor joining algorithm. Like neighbor joining, the method takes a distance matrix as input, and works by agglomerating clusters. However, the NeighborNet algorithm can lead to collections of clusters which overlap and do not form a hierarchy, and are represented using a type of phylogenetic network called a splits graph. If the distance matrix satisfies the Kalmanson combinatorial conditions then Neighbor-net will return the corresponding circular ordering. The method is implemented in the SplitsTree and R/Phangorn packages.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Neighbor-net
NeighborNet is an algorithm for constructing phylogenetic networks which is loosely based on the neighbor joining algorithm. Like neighbor joining, the method takes a distance matrix as input, and works by agglomerating clusters. However, the NeighborNet algorithm can lead to collections of clusters which overlap and do not form a hierarchy, and are represented using a type of phylogenetic network called a splits graph. If the distance matrix satisfies the Kalmanson combinatorial conditions then Neighbor-net will return the corresponding circular ordering. The method is implemented in the SplitsTree and R/Phangorn packages.
has abstract
Neighbor-net (anche NeighborNe ...... ntato dal software SplitsTree.
@it
NeighborNet is an algorithm fo ...... linguistics, and archaeology.
@en
Wikipage page ID
35,989,789
page length (characters) of wiki page
Wikipage revision ID
995,399,796
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Neighbor-net (anche NeighborNe ...... ntato dal software SplitsTree.
@it
NeighborNet is an algorithm fo ...... sTree and R/Phangorn packages.
@en
label
Neighbor-net
@en
Neighbor-net
@it