Pages that link to "Item:Q5492891"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492891):
Displaying 10 items.
- Minimum common string partition revisited (Q437061) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
- On the Cost of Interchange Rearrangement in Strings (Q5900366) (← 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)