Pages that link to "Item:Q414864"

The following pages link to A three-string approach to the closest string problem (Q414864):

Displaying 13 items.

• Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
• On approximating string selection problems with outliers (Q391209) (← links)
• On the hardness of the consensus string problem (Q396596) (← links)
• Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
• An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications (Q507397) (← links)
• The parameterized complexity of the shared center problem (Q517791) (← links)
• Consensus string problem for multiple regular languages (Q2042725) (← links)
• Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
• A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
• Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
• (Q5075765) (← links)
• Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)