Adjacent Swaps on Strings

DOI10.1007/978-3-540-69733-6_30zbMath1148.68415OpenAlexW1545057729MaRDI QIDQ3511341

Hal Sudborough, Bhadrachalam Chitturi, Walter Voit, Xuerong Feng

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_30

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (5)

A NOTE ON COMPLEXITY OF GENETIC MUTATIONS ⋮ Sorting on graphs by adjacent swaps using permutation groups ⋮ UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE ⋮ Layered graphs: applications and algorithms ⋮ Bounding prefix transposition distance for strings and permutations

Cites Work

• Transforming cabbage into turnip
• Sorting with fixed-length reversals

This page was built for publication: Adjacent Swaps on Strings