However, the minimum network is less robust against parameter variations than the original network with nested feedback loops.
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 was constructed manually with all equally parsimonious connections being represented.
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].
Experimental results show that, although suboptimal, a Lagrangian-based heuristic consisting in solving a series of minimum network cost flow problems is attractive for practical implementation, both for the quality of the solutions and for the small computational times.
A minimum-spanning network was then inferred in Arlequin 3.5.1.3 [ 49] and used to create a minimum-spanning tree (MST) using Hapstar 0.5 [ 50].
A minimum-spanning network was also reconstructed based on the mutational steps between haplotypes of cpDNA.
For example in the Figure 4 (Polska network), the minimum network cost found by CCE-GA are 11% and 6% better than Tabu Search and CDE-GA, respectively.
The minimum spanning network is embedding all minimum spanning trees computed based on the matrix of pairwise distances that is calculated between all pairs of haplotypes [ 81].
RI, MRI, and PE values of minimum cost network are 0.364, 0.849, and 0.555, respectively.
