Pages that link to "Item:Q1978500"
From MaRDI portal
The following pages link to Topology of strings: median string is NP-complete (Q1978500):
Displaying 9 items.
- Heuristics for the generalized median graph problem (Q323345) (← links)
- Generalized median graph computation by means of graph embedding in vector spaces (Q962746) (← 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)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← 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)
