On the Efficiency of the Hamming C-Centerstring Problems
From MaRDI portal
(Redirected from Publication:5165585)
Recommendations
- scientific article; zbMATH DE number 1305511
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
- On the complexity of the identification problem in Hamming spaces
- scientific article; zbMATH DE number 714495
- On the Hamming distance of constraint satisfaction problems.
- The center location improvement problem under the Hamming distance
- Complexities of the centre and median string problems
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
Cited in
(12)- Combinatorial \(n\)-fold integer programming and applications
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- scientific article; zbMATH DE number 1615274 (Why is no real title available?)
- Complexities of the centre and median string problems
- On the hardness of the consensus string problem
- scientific article; zbMATH DE number 1305511 (Why is no real title available?)
- On computing centroids according to the p-norms of Hamming distance vectors
- Tight hardness results for consensus problems on circular strings and time series
- Consensus string problem for multiple regular languages
- Max-distance sparsification for diversification and clustering
- The consensus string problem for a metric is NP-complete
- Approximation algorithms for Hamming clustering problems
This page was built for publication: On the Efficiency of the Hamming C-Centerstring Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165585)
