APPROXIMATE BLOCK SORTING
From MaRDI portal
Recommendations
Cites work
- (1+)-approximation of sorting by reversals and transpositions.
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- Block Sorting is Hard
- Bounds for sorting by prefix reversal
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Sorting a bridge hand
- Sorting by bounded block-moves
- Sorting by short block-moves
- Sorting by Transpositions
- Sorting strings by reversals and by transpositions
Cited in
(21)- A quadratic time 2-approximation algorithm for block sorting
- Sorting by bounded block-moves
- Sorting by short block-moves
- Permutation-constrained common string partitions with applications
- Approximation algorithms for sorting permutations by extreme block-interchanges
- An approximation algorithm for sorting by bounded singleton moves
- Block Sorting Is APX-Hard
- A (1+)-approximation algorithm for sorting by short block-moves
- Computing and Combinatorics
- A 14/11-approximation algorithm for sorting by short block-moves
- Fundamentals of Computation Theory
- On an NP-hard sorting problem
- Block sorting: a characterization and some heuristics
- Block Sorting is Hard
- Sorting a bridge hand
- Sorting by prefix block-interchanges
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Block crossings in one-sided tanglegrams
- Short block-move-CPP is \textsf{NP}-complete
- Permutation-constrained common string partitions with applications
- Block crossings in one-sided tanglegrams
This page was built for publication: APPROXIMATE BLOCK SORTING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5291300)
