More Efficient Algorithms for Closest String and Substring Problems
From MaRDI portal
Publication:3586187
DOI10.1137/080739069zbMath1206.68377OpenAlexW2044713370MaRDI QIDQ3586187
Publication date: 6 September 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080739069
Related Items (22)
Configurations and minority in the string consensus problem ⋮ What’s Next? Future Directions in Parameterized Complexity ⋮ Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ Polynomial time approximation schemes for all 1-center problems on metric rational set similarities ⋮ On approximating string selection problems with outliers ⋮ On the hardness of the consensus string problem ⋮ A three-string approach to the closest string problem ⋮ On the string consensus problem and the Manhattan sequence consensus problem ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Designing and Implementing Algorithms for the Closest String Problem ⋮ The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance ⋮ Parameterized complexity analysis for the closest string with wildcards problem ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ The parameterized complexity of the shared center problem ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Unnamed Item ⋮ Listing Center Strings Under the Edit Distance Metric ⋮ Slightly Superexponential Parameterized Problems ⋮ Closest substring problems for regular languages ⋮ Consensus string problem for multiple regular languages ⋮ Designing and implementing algorithms for the closest string problem ⋮ Randomized fixed-parameter algorithms for the closest string problem
This page was built for publication: More Efficient Algorithms for Closest String and Substring Problems
