Sorting a bridge hand

DOI10.1016/S0012-365X(01)00150-9MaRDI QIDQ5951942zbMATH OpenOpenAlexFDO

Authors Henrik Eriksson, Kimmo Eriksson, Johan Karlander, Johan Wästlund, Lars Svensson

Publication date 22 April 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00150-9

zbMATH Keywords

bridge handbridge playerCayley graphoptimal sortingpermutationpolynomial time algorithmtranspositions

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Protein sequences, DNA sequences (92D20)

Recommendations

• APPROXIMATE BLOCK SORTING
• Sorting by short block-moves
• Block sorting: a characterization and some heuristics
• Sorting permutations by block-interchanges
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

Cited in

(33)

• An approximation algorithm for sorting by reversals and transpositions
• Sorting by insertion of leading elements
• Sorting permutations with transpositions in \(O(n^3)\) amortized time
• Approximation algorithms for sorting by bounded singleton moves
• Sorting by shuffling methods and a queue
• Short proofs for cut-and-paste sorting of permutations
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• On sorting by 3-bounded transpositions
• Representing permutations with few moves
• An audit tool for genome rearrangement algorithms
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• Block Crossings in Storyline Visualizations
• Computing signed permutations of polygons
• Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps
• A (1+)-approximation algorithm for sorting by short block-moves
• Sorting permutations: games, genomes, and cycles
• Sorting by placement and shift
• Statistical and Combinatorial Aspects of Comparative Genomics*
• Prefix and suffix transreversals on binary and ternary strings
• CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
• Quantifying CDS sortability of permutations by strategic pile size
• APPROXIMATE BLOCK SORTING
• Pattern containment in circular permutations
• Berge sorting
• Block crossings in one-sided tanglegrams
• Sorting by shuffling methods and a queue
• Sorting permutations and binary strings by length-weighted rearrangements
• Block crossings in one-sided tanglegrams
• Permutations with restricted cycle lengths
• Transposition diameter on circular binary strings
• Constructing permutation codes under the generalized Kendall- metric
• Bounding prefix transposition distance for strings and permutations
• Structural properties and tractability results for linear synteny

This page was built for publication: Sorting a bridge hand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951942)