The following pages link to (Q4737692):
Displayed 9 items.
- Minimum common string partition revisited (Q437061) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706) (← links)
- The greedy algorithm for edit distance with moves (Q1045883) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)