A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem

DOI10.1080/10556788.2013.833616zbMath1305.90307OpenAlexW2067948622MaRDI QIDQ2926047

Elisa Pappalardo, Domenico Cantone, Panos M. Pardalos

Publication date: 29 October 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2013.833616

zbMATH Keywords

heuristicsbioinformaticscomputational biologyNP-hard problemsclosest string problemsimulated-annealing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

On the role of metaheuristic optimization in bioinformatics

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A three-string approach to the closest string problem
• On covering problems of codes
• Exact algorithm and heuristic for the closest string problem
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Efficient solutions for the far from most string problem
• 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
• Improved LP-based algorithms for the closest string problem
• Center and distinguisher for strings with unbounded alphabet
• A parallel multistart algorithm for the closest string problem
• Optimal Solutions for the Closest-String Problem via Integer Programming
• On the closest string and substring problems
• Mersenne twister
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems

This page was built for publication: A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem