More efficient algorithms for closest string and substring problems
From MaRDI portal
Recommendations
Cited in
(39)- On approximating string selection problems with outliers
- Consensus string problem for multiple regular languages
- Designing and implementing algorithms for the closest string problem
- Approximate maximum rank aggregation: beyond the worst-case
- On the hardness of the consensus string problem
- Randomized fixed-parameter algorithms for the closest string problem
- An improved lower bound on approximation algorithms for the closest substring problem
- A three-string approach to the closest string problem
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- What's next? Future directions in parameterized complexity
- Low-Rank Binary Matrix Approximation in Column-Sum Norm.
- Designing and Implementing Algorithms for the Closest String Problem
- Hard problems in similarity searching
- Configurations and minority in the string consensus problem
- scientific article; zbMATH DE number 2081011 (Why is no real title available?)
- Closest substring problems for regular languages
- Closest substring problems for regular languages
- Slightly superexponential parameterized problems
- Lower bounds for approximation schemes for Closest String
- A three-string approach to the closest string problem
- Complexity of approximating closest substring problems.
- The Editor's Corner: Strings, Substrings, and the `Nearest Integer' Function
- On the string consensus problem and the Manhattan sequence consensus problem
- scientific article; zbMATH DE number 7525465 (Why is no real title available?)
- Consensus string problem for multiple regular languages
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
- Combinatorial Pattern Matching
- On the closest string and substring problems
- Parameterized complexity analysis for the closest string with wildcards problem
- Closest Substring Problems with Small Distances
- Listing center strings under the edit distance metric
- A Lower Bound on Approximation Algorithms for the Closest Substring Problem
- The parameterized complexity of the shared center problem
- The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity
- Efficient solutions for the far from most string problem
- scientific article; zbMATH DE number 1615273 (Why is no real title available?)
- Combinatorial \(n\)-fold integer programming and applications
This page was built for publication: More efficient algorithms for closest string and substring problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586187)
