Pages that link to "Item:Q5874533"
From MaRDI portal
The following pages link to The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533):
Displaying 6 items.
- Center and distinguisher for strings with unbounded alphabet (Q1810861) (← links)
- Topology of strings: median string is NP-complete (Q1978500) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- On the Efficiency of the Hamming C-Centerstring Problems (Q5165585) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)