Distinguishing string selection problems.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1305456
- Optimization approaches for solving string selection problems
- Fundamentals of Computation Theory
- Parameterized intractability of distinguishing substring selection
- scientific article; zbMATH DE number 2086667
- Heuristic approaches to the distinguishing substring selection problem
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- LP-based heuristics for the distinguishing string and substring selection problems
- On the far from most string problem, one of the hardest string selection problems
- scientific article; zbMATH DE number 7559472
Cites work
- Algorithms on Strings, Trees and Sequences
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305456 (Why is no real title available?)
- scientific article; zbMATH DE number 1305511 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- On covering problems of codes
- Optimization, approximation, and complexity classes
- The complexity and approximability of finding maximum feasible subsystems of linear relations
Cited in
(53)- Sublinear time motif discovery from multiple sequences
- On the kernelization complexity of string problems
- Efficient solutions for the far from most string problem
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- Combinatorial \(n\)-fold integer programming and applications
- On the computational complexity of closest genome problems
- Consensus strings with small maximum distance and small distance sum
- A multiparametric view on answer set programming
- Designing and implementing algorithms for the closest string problem
- A parallel multistart algorithm for the closest string problem
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- An algorithm for the maximum likelihood problem on evolutionary trees
- Randomized fixed-parameter algorithms for the closest string problem
- On some optimization problems in molecular biology
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- LP-based heuristics for the distinguishing string and substring selection problems
- Hybridizations of GRASP with path relinking for the far from most string problem
- Configurations and minority in the string consensus problem
- On approximating string selection problems with outliers
- On some multiobjective optimization problems arising in biology
- Generalized closest substring encryption
- Consensus patterns (probably) has no EPTAS
- Faster Algorithm for the Set Variant of the String Barcoding Problem
- On approximating string selection problems with outliers
- A three-string approach to the closest string problem
- scientific article; zbMATH DE number 1305456 (Why is no real title available?)
- Designing and Implementing Algorithms for the Closest String Problem
- Consensus strings with small maximum distance and small distance sum
- On computing centroids according to the p-norms of Hamming distance vectors
- Separating sets of strings by finding matching patterns is almost always hard
- On the far from most string problem, one of the hardest string selection problems
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- Missing pattern discovery
- Listing center strings under the edit distance metric
- Slightly superexponential parameterized problems
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
- Closest substring problems for regular languages
- Fairness in temporal slot assignment
- Application of negative learning ant colony optimization to the far from most string problem
- The k-centre problem for classes of cyclic words
- An optimization modelling for string selection in molecular biology using Pareto optimality
- Improved optimization modelling for the closest string and related problems
- On the complexity of the median and closest permutation problems
- Exact algorithm and heuristic for the closest string problem
- On the complexity of finding central configurations of the graph-generalized ( n^2 - 1 )-puzzle
- On the complexity of finding 1-center spanning trees
- Hardness of median and center in the Ulam metric
- Binary k-center with missing entries: structure leads to tractability
- On the longest common rigid subsequence problem
- The consensus string problem for a metric is NP-complete
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding
- An improved lower bound on approximation algorithms for the closest substring problem
- On the complexity of finding gapped motifs
This page was built for publication: Distinguishing string selection problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427861)
