On the closest string and substring problems
From MaRDI portal
Recommendations
Cited in
(63)- A polynomial time approximation scheme for embedding a directed hypergraph on a ring
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
- Mathematical programming in computational biology: an annotated bibliography
- On the string consensus problem and the Manhattan sequence consensus problem
- Sublinear time motif discovery from multiple sequences
- On the kernelization complexity of string problems
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem
- Finding similar regions in many sequences
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
- Combinatorial \(n\)-fold integer programming and applications
- Constant time approximation scheme for largest well predicted subset
- Near optimal solutions for maximum quasi-bicliques
- 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
- Randomized fixed-parameter algorithms for the closest string problem
- On the complexity of the spaced seeds
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
- scientific article; zbMATH DE number 1615273 (Why is no real title available?)
- Finding similar regions in many strings
- Configurations and minority in the string consensus problem
- On the closest string via rank distance
- On approximating string selection problems with outliers
- A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
- The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity
- More efficient algorithms for closest string and substring problems
- The Editor's Corner: Strings, Substrings, and the `Nearest Integer' Function
- On approximating string selection problems with outliers
- A three-string approach to the closest string problem
- scientific article; zbMATH DE number 1305511 (Why is no real title available?)
- scientific article; zbMATH DE number 2081011 (Why is no real title available?)
- Enumerating Neighbour and Closest Strings
- Configurations and minority in the string consensus problem
- Parameterized complexity analysis for the closest string with wildcards problem
- Separating sets of strings by finding matching patterns is almost always hard
- Tight hardness results for consensus problems on circular strings and time series
- A polynomial time approximation scheme for the closest shared center problem
- A closer look at the closest string and closest substring problem
- Combinatorial Pattern Matching
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- 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
- Complexity of approximating closest substring problems.
- Low-Rank Binary Matrix Approximation in Column-Sum Norm.
- The k-centre problem for classes of cyclic words
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
- Improved optimization modelling for the closest string and related problems
- On computing a center persistence diagram
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- Approximate maximum rank aggregation: beyond the worst-case
- Matrix completion: approximating the minimum diameter
- Finding a cluster in incomplete data
- Exact algorithm and heuristic for the closest string problem
- Efficient algorithms for consensus string problems minimizing both distance sum and radius
- On the complexity of finding 1-center spanning trees
- Binary k-center with missing entries: structure leads to tractability
- On the longest common rigid subsequence problem
- On a cyclic string-to-string correction problem
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
- An improved lower bound on approximation algorithms for the closest substring problem
This page was built for publication: On the closest string and substring problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196639)
