Sorting by multi-cut rearrangements

DOI10.1007/978-3-030-67731-2_43MaRDI QIDQ831850zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Sorting by \(k\)-cuts on signed permutations
• Approximation algorithms for sorting by \(k\)-cuts on signed permutations
• Prefix and Suffix Reversals on Strings
• Genome Rearrangements and Sorting by Reversals
• scientific article; zbMATH DE number 871927

Cites work

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

Cited in

(9)

• scientific article; zbMATH DE number 177571 (Why is no real title available?)
• Sorting on PRAMs with reconfigurable buses
• scientific article; zbMATH DE number 5630647 (Why is no real title available?)
• Permutation-constrained common string partitions with applications
• Sorting separable permutations by restricted multi-break rearrangements
• Approximation algorithms for sorting by \(k\)-cuts on signed permutations
• Sorting by \(k\)-cuts on signed permutations
• Sorting multisets stably in minimum space
• Permutation-constrained common string partitions with applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831850)