diff --git a/man/inversionDistance.Rd b/man/inversionDistance.Rd
index d091b2ca..8ceb2715 100644
--- a/man/inversionDistance.Rd
+++ b/man/inversionDistance.Rd
@@ -30,13 +30,13 @@ the returned value for the minimal number of inversions will imply in non-usual
 if different chromosomes have orthologous regions.
 }
 \examples{
-\dontrun{
 # Example using a permutation vector directly
 # Suppose we want to sort the permutation p = c(1, 3, -2, 4)
 inversionDistance(c(1, 3, -2, 4))
 
-# Example using a GBreaks object
-inversionDistance(exampleInversionHP1999fig4a)}
+# Example using a GBreaks object.
+# This example is based on Figure 4(a) from Hannehalli and Pevzner (1999). The inversion distance is 8.
+inversionDistance(exampleInversionHP1999fig4a)
 
 }
 \references{