Pages that link to "Item:Q5165585"
From MaRDI portal
The following pages link to On the Efficiency of the Hamming C-Centerstring Problems (Q5165585):
Displaying 5 items.
- On the hardness of the consensus string problem (Q396596) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)