A parsimony minimum spanning network was constructed using TCS1.21 [ 28], which is a more appropriate way than constructing bifurcating phylogenetic trees to view the evolutionary relationship between closely related haplotypes where ancestry may not be strictly bifurcating [ 29].
A minimum spanning network was constructed manually with all equally parsimonious connections being represented.
Using these STs, a minimum spanning tree was generated, in which 6 large clusters could be identified.
Using the STs of all of these samples, a minimum spanning tree was generated, in which 4 large clusters could be identified.
The MLVA profiles were clustered using a categorical clustering coefficient and a minimum spanning tree was constructed to display the relationships between the various MLVA types (Fig. 2).
All of the allele strings were imported into a Bionumerics software package (version 4.5; Applied Maths, Sint-Martems-Latem, Belgium) and a minimum spanning tree was created based on categorical and the priority rule highest number of single locus variants (SLV's).
To investigate the recent demographic history of this species a minimum spanning network was created in Arlequin, version 3.01 [43] and drawn by hand.
A minimum spanning tree was constructed based on 320 nucleotides in the E region of the capsid gene using the neighbor-joining algorithm with BioNumerics software (version 5.1; Applied Maths Sint-Martens-Latem Sint-Martens-Latem Sint-Martens-Latem
A minimum spanning tree was built based upon the similarity matrix using Bionumerics version 5.1.
To characterize the frequencies and relationships of different haplotypes, a minimum spanning tree was constructed.
