Pages that link to "Item:Q3395036"

The following pages link to Closest Substring Problems with Small Distances (Q3395036):

Displaying 24 items.

• Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
• On approximating string selection problems with outliers (Q391209) (← links)
• A three-string approach to the closest string problem (Q414864) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
• The parameterized complexity of the shared center problem (Q517791) (← links)
• Average parameterization and partial kernelization for computing medians (Q716309) (← links)
• Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
• On the kernelization complexity of string problems (Q1749539) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Parameterized low-rank binary matrix approximation (Q2218414) (← links)
• Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
• Consensus strings with small maximum distance and small distance sum (Q2309476) (← 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)
• Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
• Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
• Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
• (Q5005095) (← links)
• Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
• Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)