Sorting by multi-cut rearrangements

DOI10.1007/978-3-030-67731-2_43zbMath1490.68303OpenAlexW3169043692MaRDI QIDQ831850

Christian Komusiewicz, Guillaume Fertin, Laurent Bulteau, Géraldine Jean

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Permutation-constrained common string partitions with applications ⋮ Sorting by \(k\)-cuts on signed permutations ⋮ Approximation algorithms for sorting by \(k\)-cuts on signed permutations

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Sorting permutations by block-interchanges
• Bin packing with fixed number of bins revisited
• Sorting by Transpositions Is Difficult
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
• Parameterized Algorithms
• Algorithms and Computation

This page was built for publication: Sorting by multi-cut rearrangements