Pages that link to "Item:Q261382"

The following pages link to Randomized fixed-parameter algorithms for the closest string problem (Q261382):

Displaying 14 items.

• Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
• Exact algorithm and heuristic for the closest string problem (Q716344) (← links)
• Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
• Fixed-parameter algorithms for CLOSEST STRING and related problems (Q1424248) (← links)
• A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
• Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
• A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
• Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
• Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
• Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
• Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600) (← links)
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)