Pages that link to "Item:Q2870513"
From MaRDI portal
The following pages link to Lower bounding edit distances between permutations (Q2870513):
Displaying 16 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)
- On the distance between the expressions of a permutation (Q709253) (← links)
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics (Q1633269) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Sorting with forbidden intermediates (Q2181215) (← links)
- On the edit distance of powers of cycles (Q2317648) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342) (← links)
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations (Q2818210) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- (Q6065464) (← links)
- Move schedules: fast persistence computations in coarse dynamic settings (Q6589170) (← links)