Lower Bounding Edit Distances between Permutations

DOI10.1137/13090897XzbMath1286.68366arXiv1201.0365OpenAlexW1964652076MaRDI QIDQ2870513

Anthony Labarre

Publication date: 21 January 2014

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

Full work available at URL: https://arxiv.org/abs/1201.0365

zbMATH Keywords

symmetric grouplower boundstranspositionsedit distancetheoretical aspects of computational biology

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) General biology and biomathematics (92B05) Symmetric groups (20B30)

Related Items (9)

Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics ⋮ Sorting on graphs by adjacent swaps using permutation groups ⋮ Sorting with forbidden intermediates ⋮ Sorting by prefix block-interchanges ⋮ Unnamed Item ⋮ Sorting by prefix reversals and prefix transpositions ⋮ CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS ⋮ Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations ⋮ An Audit Tool for Genome Rearrangement Algorithms

This page was built for publication: Lower Bounding Edit Distances between Permutations