The phrase "a minimum spanning network" is correct and usable in written English.
It can be used in contexts related to graph theory, computer science, or network design, where you are discussing a network that connects all points with the least total edge weight.
Example: "In our analysis, we found that a minimum spanning network is essential for optimizing the connectivity of the system."
Alternatives: "a minimum spanning tree" or "an optimal spanning network".
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 network of mtDNA haplotypes was constructed using statistical parsimony [26] as implemented in the program tcs version 1.21 [27].
A median joining algorithm was used to build a minimum spanning network to examine the evolutionary relationships among haplotypes, as implemented in Network 4.5 (http://fluxus-engineering.com/).
The relationships between genotypes were represented using a minimum spanning network (MSN).
The three Y-chromosomal microsatellites were only used to reconstruct a minimum spanning network.
A minimum spanning network was constructed manually with all equally parsimonious connections being represented.
A Neighbour-Joining analysis of the 281 sequences revealed two major clades (A and B) supported by a bootstrap value of 75% (Figure S1), and a minimum-spanning network (MSN) was drawn to show the relationship between haplotype within and between clades (Figure 1).
Third, while 3 genotypes were suggested as being the original founders of all forest infestations in California, that inference was based only on their relative dominance and positioning within a minimum-spanning network (Mascheretti et al. 2008, 2009).
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].
The "median-joining" algorithm (Bandelt et al. 1999) constructs an informative subnetwork of the full quasi-median network, repeatedly using the concept of a (relaxed) minimum spanning network and repeatedly employing the quasi-median calculation.
As such, eBURST and a maximum parsimony minimum spanning network analyses were carried out.
