Efficient solutions for the far from most string problem

DOI10.1007/s10479-011-1028-7zbMath1251.90317OpenAlexW2138481196MaRDI QIDQ1761847

Paola Festa, Panos M. Pardalos

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1028-7

zbMATH Keywords

combinatorial optimizationmetaheuristicscomputational biologymolecular structure predictionprotein and sequences alignment

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A nonmonotone GRASP, A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem, On approximating string selection problems with outliers, Application of negative learning ant colony optimization to the far from most string problem, Local search for string problems: brute-force is essentially optimal

Uses Software

• GRASP

Cites Work

• On covering problems of codes
• Heuristic procedures for solving the discrete ordered median problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Genetic algorithms and network ring design
• Multicriteria inventory classification using a genetic algorithm
• Distinguishing string selection problems.
• Greedy randomized adaptive search procedures
• Genetic algorithms: Foundations and applications
• Probability distribution of solution time in GRASP: an experimental investigation
• Genetic and hybrid algorithms for graph coloring
• A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
• A parallel multistart algorithm for the closest string problem
• On some optimization problems in molecular biology
• Finding similar regions in many strings
• Optimal Solutions for the Closest-String Problem via Integer Programming
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item