Pages that link to "Item:Q437061"
From MaRDI portal
The following pages link to Minimum common string partition revisited (Q437061):
Displayed 12 items.
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← 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)
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- The complexity of finding common partitions of genomes with predefined block sizes (Q2163952) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← 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)