The end result of the Girvan Newman algorithm is a dendrogram.
2.
Hence, the subsets can be represented using a tree diagram, or dendrogram.
3.
The leaves of the dendrogram are individual nodes.
4.
Then, Ayub et al . 2003 did the same thing using 182 loci ( view dendrogram ).
5.
The relatedness of isolates can then be visualized with a dendrogram generated from the matrix of pairwise differences between the electrophoretic types.
6.
Using a " reachability-plot " ( a special kind of dendrogram ), the hierarchical structure of the clusters can be obtained easily.
7.
The result of the clustering can be visualized as a dendrogram, which shows the sequence of cluster fusion and the distance at which each fusion took place.
8.
The outcome of a cladistic analysis is a cladogram a tree-shaped diagram ( dendrogram ) that is interpreted to represent the best hypothesis of phylogenetic relationships.
9.
In this example, cutting after the second row of the dendrogram will yield clusters { a } { b c } { d e } { f }.
10.
The relatedness of isolates is displayed as a dendrogram constructed using the matrix of pairwise differences between their allelic profiles, eBURST or a minimum spanning tree ( MST ).
