Pages that link to "Item:Q2377380"
From MaRDI portal
The following pages link to On sorting unsigned permutations by double-cut-and-joins (Q2377380):
Displaying 8 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications (Q1790950) (← links)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- A new approach for the reversal distance with indels and moves in intergenic regions (Q2163962) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- (Q6065464) (← links)