Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions

DOI10.1007/978-3-642-54423-1_58zbMath1405.68445OpenAlexW13585655MaRDI QIDQ5405082

Zanoni Dias, Carla Negri Lintzmayer

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_58

Mathematics Subject Classification ID

Searching and sorting (68P10) Problems related to evolution (92D15) Combinatorics in computer science (68R05) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (4)

Prefix and Suffix Reversals on Strings ⋮ Prefix and suffix transreversals on binary and ternary strings ⋮ Approximation algorithms for sorting by length-weighted prefix and suffix operations ⋮ Sorting permutations and binary strings by length-weighted rearrangements

This page was built for publication: Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions