Pages that link to "Item:Q868388"
From MaRDI portal
The following pages link to Approximating reversal distance for strings with bounded number of duplicates (Q868388):
Displaying 11 items.
- Minimum common string partition revisited (Q437061) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← 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)
- A note on complexity of genetic mutations (Q2890984) (← 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 Cost of Interchange Rearrangement in Strings (Q5900366) (← links)
