Pages that link to "Item:Q5165596"

The following pages link to Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596):

Displaying 11 items.

• Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
• The set of parameterized \(k\)-covers problem (Q418000) (← links)
• Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
• Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
• On the kernelization complexity of string problems (Q1749539) (← links)
• Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
• A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
• Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
• Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← 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)