Pages that link to "Item:Q1427861"
From MaRDI portal
The following pages link to Distinguishing string selection problems. (Q1427861):
Displaying 38 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- Generalized closest substring encryption (Q300391) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Missing pattern discovery (Q553949) (← 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)
- Exact algorithm and heuristic for the closest string problem (Q716344) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- On the complexity of finding gapped motifs (Q972352) (← 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)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Designing and implementing algorithms for the closest string problem (Q2319901) (← 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)
- An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441) (← 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)
- LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- On some multiobjective optimization problems arising in biology (Q2995503) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- (Q5005095) (← links)
- (Q5075765) (← 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)
- Closest substring problems for regular languages (Q5918147) (← links)
