Pages that link to "Item:Q858110"
From MaRDI portal
The following pages link to On the parameterized intractability of motif search problems (Q858110):
Displaying 19 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- The parameterized complexity of the shared center problem (Q517791) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Parameterized intractability of distinguishing substring selection (Q2432546) (← links)
- Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Consensus strings with small maximum distance and small distance sum (Q5005095) (← links)
- Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
