Pages that link to "Item:Q5443527"
From MaRDI portal
The following pages link to Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set (Q5443527):
Displaying 15 items.
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
- Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← links)
- Prefix and suffix reversals on strings (Q1647842) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Heuristics for Reversal Distance Between Genomes with Duplicated Genes (Q5041123) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant (Q5140766) (← links)
- On the Approximability of Comparing Genomes with Duplicates (Q5452150) (← links)
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)
- Signed rearrangement distances considering repeated genes, intergenic regions, and indels (Q6053967) (← links)
- Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)
