Pages that link to "Item:Q876700"
From MaRDI portal
The following pages link to The consensus string problem for a metric is NP-complete (Q876700):
Displaying 9 items.
- Ensemble clustering by means of clustering embedding in vector spaces (Q898340) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
- The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
