The following pages link to (Q4737204):
Displaying 5 items.
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
