Pages that link to "Item:Q2432546"

The following pages link to Parameterized intractability of distinguishing substring selection (Q2432546):

Displaying 3 items.

• On approximating string selection problems with outliers (Q391209) (← links)
• Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
• An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)