Sorting by multi-cut rearrangements
DOI10.1007/978-3-030-67731-2_43zbMATH Open1490.68303OpenAlexW3169043692MaRDI QIDQ831850FDOQ831850
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
Recommendations
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)
Cites Work
- Fundamentals of parameterized complexity
- Parameterized Algorithms
- Algorithms and Computation
- Title not available (Why is that?)
- Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
- Bin packing with fixed number of bins revisited
- Sorting by Transpositions
- Sorting by Transpositions Is Difficult
- Genome Rearrangements and Sorting by Reversals
- Sorting permutations by block-interchanges
Cited In (9)
- Title not available (Why is that?)
- Sorting on PRAMs with reconfigurable buses
- Title not available (Why is that?)
- Permutation-constrained common string partitions with applications
- Sorting with forbidden intermediates
- 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)
