Pages that link to "Item:Q3586187"
From MaRDI portal
The following pages link to More Efficient Algorithms for Closest String and Substring Problems (Q3586187):
Displayed 22 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- The parameterized complexity of the shared center problem (Q517791) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- (Q5075765) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← 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)
- Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)