The following pages link to Sorting a bridge hand (Q5951942):
Displaying 24 items.
- Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps (Q329537) (← links)
- A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865) (← links)
- Prefix and suffix transreversals on binary and ternary strings (Q491633) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Approximation algorithms for sorting by bounded singleton moves (Q2143142) (← links)
- Sorting by shuffling methods and a queue (Q2161211) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- Representing Permutations with Few Moves (Q2827490) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- Block Crossings in Storyline Visualizations (Q2961533) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Statistical and Combinatorial Aspects of Comparative Genomics* (Q4677089) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- APPROXIMATE BLOCK SORTING (Q5291300) (← links)
- (Q5383238) (← links)
- Sorting by shuffling methods and a queue (Q6604695) (← links)
