Pages that link to "Item:Q3196639"

The following pages link to On the closest string and substring problems (Q3196639):

Displaying 37 items.

• Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
• Configurations and minority in the string consensus problem (Q289911) (← 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)
• A polynomial time approximation scheme for the closest shared center problem (Q513292) (← links)
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (Q650915) (← links)
• Improved optimization modelling for the closest string and related problems (Q651767) (← 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)
• On the longest common rigid subsequence problem (Q848965) (← links)
• Sublinear time width-bounded separators and their application to the protein side-chain packing problem (Q927195) (← links)
• An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
• A polynomial time approximation scheme for embedding a directed hypergraph on a ring (Q1045935) (← links)
• Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem (Q1651649) (← links)
• Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
• On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
• Sublinear time motif discovery from multiple sequences (Q1736589) (← links)
• On the kernelization complexity of string problems (Q1749539) (← links)
• A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
• A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
• Finding similar regions in many sequences (Q1869936) (← links)
• A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring (Q1928513) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
• Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
• A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
• Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
• On the complexity of the spaced seeds (Q2643726) (← links)
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
• A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← 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)
• Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
• Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)