Pages that link to "Item:Q764373"
From MaRDI portal
The following pages link to Bounding prefix transposition distance for strings and permutations (Q764373):
Displaying 14 items.
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Hamiltonian cycles in unitary prefix transposition rearrangement graphs (Q491601) (← links)
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Prefix transpositions on binary and ternary strings (Q2377235) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- Upper bounds and exact values on transposition distance of permutations (Q2918476) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334) (← links)
- A new upper bound for sorting permutations with prefix transpositions (Q5859487) (← links)
- On the Cost of Interchange Rearrangement in Strings (Q5900366) (← links)
