Pages that link to "Item:Q5313049"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313049):
Displayed 14 items.
- Minimum common string partition revisited (Q437061) (← 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)
- Edit distance with block deletions (Q1736478) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161) (← links)
- Edit distance with move operations (Q2457310) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies (Q3011843) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- (Q5140766) (← links)
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)
- Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)