Distinguishing string selection problems.

DOI10.1016/S0890-5401(03)00057-9zbMath1069.68116WikidataQ59445237 ScholiaQ59445237MaRDI QIDQ1427861

Ming Li, Shaojiu Wang, Louxin Zhang, Bin Ma, J. Kevin Lanctot

Publication date: 14 March 2004

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

closest substring problemfarthest string problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (41)

Configurations and minority in the string consensus problem ⋮ Generalized closest substring encryption ⋮ Consensus Patterns (Probably) Has no EPTAS ⋮ On the longest common rigid subsequence problem ⋮ On some optimization problems in molecular biology ⋮ Efficient Algorithms for the Closest String and Distinguishing String Selection Problems ⋮ Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ On approximating string selection problems with outliers ⋮ LP-based heuristics for the distinguishing string and substring selection problems ⋮ Fairness in temporal slot assignment ⋮ A three-string approach to the closest string problem ⋮ Application of negative learning ant colony optimization to the far from most string problem ⋮ The k-centre problem for classes of cyclic words ⋮ Unnamed Item ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ An optimization modelling for string selection in molecular biology using Pareto optimality ⋮ Improved optimization modelling for the closest string and related problems ⋮ On some multiobjective optimization problems arising in biology ⋮ Designing and Implementing Algorithms for the Closest String Problem ⋮ The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance ⋮ Sublinear time motif discovery from multiple sequences ⋮ On the kernelization complexity of string problems ⋮ An improved lower bound on approximation algorithms for the closest substring problem ⋮ Efficient solutions for the far from most string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ A parallel multistart algorithm for the closest string problem ⋮ On the complexity of finding gapped motifs ⋮ Unnamed Item ⋮ Listing Center Strings Under the Edit Distance Metric ⋮ Slightly Superexponential Parameterized Problems ⋮ Missing pattern discovery ⋮ Exact algorithm and heuristic for the closest string problem ⋮ Closest substring problems for regular languages ⋮ On the computational complexity of closest genome problems ⋮ Hybridizations of GRASP with path relinking for the far from most string problem ⋮ Consensus strings with small maximum distance and small distance sum ⋮ A multiparametric view on answer set programming ⋮ Designing and implementing algorithms for the closest string problem ⋮ Hardness results for the center and median string problems under the weighted and unweighted edit distances ⋮ An algorithm for the maximum likelihood problem on evolutionary trees ⋮ Randomized fixed-parameter algorithms for the closest string problem

Cites Work

• On covering problems of codes
• Optimization, approximation, and complexity classes
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distinguishing string selection problems.