The following pages link to (Q4736845):
Displaying 8 items.
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
- Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600) (← links)
