Pages that link to "Item:Q5321718"

The following pages link to Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718):

Displaying 28 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)
• A three-string approach to the closest string problem (Q414864) (← links)
• Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
• The parameterized complexity of the shared center problem (Q517791) (← links)
• Negative selection algorithms on strings with efficient training and linear-time classification (Q627104) (← links)
• Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
• Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← links)
• Fixed-parameter algorithms for CLOSEST STRING and related problems (Q1424248) (← links)
• Distinguishing string selection problems. (Q1427861) (← links)
• Efficient solutions for the far from most string problem (Q1761847) (← links)
• A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
• Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← links)
• String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
• LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
• Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
• A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
• (Q4207596) (← links)
• (Q4252342) (← links)
• Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
• Enumerating Neighbour and Closest Strings (Q4899258) (← links)
• Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
• Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600) (← links)
• Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• Fundamentals of Computation Theory (Q5900797) (← links)