Skip to main content
Figure 11 | BMC Bioinformatics

Figure 11

From: A unifying model of genome evolution under parsimony

Figure 11

Extension operations used to demonstrate the upper bound. (A) A root labeling extension. (B) A substitution ambiguity reducing extension. (C-D) Junction side attachment extensions. (E) A rearrangement ambiguity reducing extensions. Elements in red/outlined in red are those added in extension.

Back to article page