Sorting with fixed-length reversals

DOI10.1016/S0166-218X(96)00069-8zbMath0870.68052MaRDI QIDQ5961630

Steven S. Skiena, Ting Chen

Publication date: 7 September 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

interconnection networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Problems related to evolution (92D15) Applications of graph theory (05C90)

Related Items (11)

Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics ⋮ A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation ⋮ Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ Adjacent Swaps on Strings ⋮ Inconsistent heuristics in theory and practice ⋮ Models of active learning in group-structured state spaces ⋮ The `Butterfly effect' in Cayley graphs with applications to genomics. ⋮ Vertex reconstruction in Cayley graphs ⋮ Exact upper bound for sorting Rn with LE ⋮ SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS ⋮ Sorting by bounded block-moves

Cites Work

• The complexity of finding minimum-length generator sequences
• Bounds for sorting by prefix reversal
• Reversing trains: A turn of the century sorting problem
• Genome Rearrangements and Sorting by Reversals
• Polynomial-time algorithm for computing translocation distance between genomes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sorting with fixed-length reversals