Pages that link to "Item:Q3550844"
From MaRDI portal
The following pages link to Complexities of the Centre and Median String Problems (Q3550844):
Displayed 5 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings (Q2323348) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)