Pages that link to "Item:Q2569417"
From MaRDI portal
The following pages link to Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417):
Displaying 7 items.
- Exact mean computation in dynamic time warping spaces (Q2218328) (← links)
- Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings (Q2323348) (← links)
- An efficient approach for the rank aggregation problem (Q2503315) (← links)
- Learning the Language of Biological Sequences (Q2963599) (← links)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)