Pages that link to "Item:Q2490115"
From MaRDI portal
The following pages link to A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115):
Displaying 17 items.
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- A new approximation algorithm for unsigned translocation sorting (Q1708438) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach (Q2569412) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- A New and Faster Method of Sorting by Transpositions (Q3506916) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- Zig-zag sort (Q5259604) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
