Pages that link to "Item:Q2432546"
From MaRDI portal
The following pages link to Parameterized intractability of distinguishing substring selection (Q2432546):
Displaying 13 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding (Q941834) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- Generalized substring selectivity estimation (Q1394798) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Complexity of substring search in a set of strings (Q1791617) (← links)
- Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← links)
- LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
- (Q4252342) (← links)
- Fundamentals of Computation Theory (Q5900797) (← links)
- Solving Not-Substring Constraint withFlat Abstraction (Q6488164) (← links)