A parallel multistart algorithm for the closest string problem

DOI10.1016/j.cor.2007.04.002zbMath1209.92024OpenAlexW1986798565MaRDI QIDQ2483510

Gerardo Valdisio R. Viana, Fernando C. Gomes, Panos M. Pardalos, Cláudio N. Meneses

Publication date: 28 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.04.002

zbMATH Keywords

sequence analysisparallel algorithmsclosest string problem

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Parallel numerical computation (65Y05) Theory of error-correcting codes and error-detecting codes (94B99) Systems biology, networks (92C42)

Related Items (11)

An improved integer linear programming formulation for the closest 0-1 string problem ⋮ A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ 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 ⋮ Parallel metaheuristics: recent advances and new trends ⋮ 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 ⋮ Exact algorithm and heuristic for the closest string problem

Uses Software

• CPLEX

Cites Work

• Distinguishing string selection problems.
• Optimal Solutions for the Closest-String Problem via Integer Programming
• On the closest string and substring problems
• Unnamed Item

This page was built for publication: A parallel multistart algorithm for the closest string problem