Pages that link to "Item:Q1010605"
From MaRDI portal
The following pages link to Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605):
Displaying 4 items.
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Minimum common string partition revisited (Q437061) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)