The following pages link to (Q4737204):
Displaying 9 items.
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Generalized substring selectivity estimation (Q1394798) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← 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)
- (Q4252342) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
