  In comparison to phylogenetic trees, phylogenetic networks are more suitable
to represent complex evolutionary histories of species whose past includes
reticulation such as hybridisation or lateral gene transfer. However, the
reconstruction of phylogenetic networks remains challenging and computationally
expensive due to their intricate structural properties. For example, the small
parsimony problem that is solvable in polynomial time for phylogenetic trees,
becomes NP-hard on phylogenetic networks under softwired and parental
parsimony, even for a single binary character and structurally constrained
networks. To calculate the parsimony score of a phylogenetic network $N$, these
two parsimony notions consider different exponential-size sets of phylogenetic
trees that can be extracted from $N$ and infer the minimum parsimony score over
all trees in the set. In this paper, we ask: What is the maximum difference
between the parsimony score of any phylogenetic tree that is contained in the
set of considered trees and a phylogenetic tree whose parsimony score equates
to the parsimony score of $N$? Given a gap-free sequence alignment of
multi-state characters and a rooted binary level-$k$ phylogenetic network, we
use the novel concept of an informative blob to show that this difference is
bounded by $k+1$ times the softwired parsimony score of $N$. In particular, the
difference is independent of the alignment length and the number of character
states. We show that an analogous bound can be obtained for the softwired
parsimony score of semi-directed networks, while under parental parsimony on
the other hand, such a bound does not hold.
