Breakpoint Graph

This function creates a breakpoint graph given an extended permutation.

Usage

breakpoint_graph(p_extended)

Arguments

p_extended

The extended permutation.

Value

The breakpoint graph.

References

Hannenhalli, Sridhar, and Pavel A. Pevzner. "Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals." Journal of the ACM (JACM) 46.1 (1999): 1-27.

See also

Other Breakpoint graph functions: bp_count(), breakpointGraphProperties(), components_graph(), cycle_count(), cycle_nontrivial_count(), extendedPermutation(), hurdles_count(), is_fortress(), is_interleaving(), superhurdles_count()

Author

Bruna Fistarol

Examples

permutationVector(exampleInversion) |>
  GenomicBreaks:::extendedPermutation() |>
  GenomicBreaks:::breakpoint_graph()
#> IGRAPH 8db7994 U--- 8 4 -- 
#> + attr: color (e/c), unoriented (e/n)
#> + edges from 8db7994:
#> [1] 3--5 3--4 4--6 5--6