The following pages link to On covering problems of codes (Q675858):
Displaying 50 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← 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)
- An optimization modelling for string selection in molecular biology using Pareto optimality (Q639159) (← links)
- Improved optimization modelling for the closest string and related problems (Q651767) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- A set covering based approach to find the reduct of variable precision rough set (Q726549) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- The approximate period problem for DNA alphabet. (Q1401415) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem (Q1651649) (← links)
- Two-string consensus problem under non-overlapping inversion and transposition distance (Q1679911) (← 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)
- Efficient solutions for the far from most string problem (Q1761847) (← 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)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- On some optimization problems in molecular biology (Q2643356) (← links)
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
- Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Using small-scale quantum devices to solve algebraic equations (Q2690295) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
- On some multiobjective optimization problems arising in biology (Q2995503) (← links)
- Recurrent Genetic Algorithms: Sustaining Evolvability (Q3164927) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation (Q4989327) (← links)
- (Q5005095) (← links)
- (Q5075765) (← links)
- (Q5111743) (← links)
- Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
