From fa0669bb19aea07bc27ee4f1eea0dc2221521ce7 Mon Sep 17 00:00:00 2001 From: pribiller Date: Wed, 19 Aug 2026 18:33:29 +0900 Subject: [PATCH] Small update in the inversion example Fix to PR #56: I forgot to update the .Rd file to remove the \dontrun fence (in PR #56, only the .R file was updated). --- man/inversionDistance.Rd | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) 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{