Sorting a bridge hand

DOI10.1016/S0012-365X(01)00150-9zbMath0990.05145MaRDI QIDQ5951942

No author found.

Publication date: 22 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cayley graph; polynomial time algorithm; permutation; transpositions; bridge hand; bridge player; optimal sorting

Mathematics Subject Classification ID

05E99: Algebraic combinatorics

92D20: Protein sequences, DNA sequences

Related Items

Statistical and Combinatorial Aspects of Comparative Genomics*, APPROXIMATE BLOCK SORTING, Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps, A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves, Prefix and suffix transreversals on binary and ternary strings, Sorting permutations and binary strings by length-weighted rearrangements, Bounding prefix transposition distance for strings and permutations, Structural properties and tractability results for linear synteny, An approximation algorithm for sorting by reversals and transpositions, 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, Sorting by Transpositions Is Difficult