A parallel multistart algorithm for the closest string problem
DOI10.1016/J.COR.2007.04.002zbMATH Open1209.92024OpenAlexW1986798565MaRDI QIDQ2483510FDOQ2483510
Authors: Fernando C. Gomes, Panos M. Pardalos, Gerardo Valdisio R. Viana, 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
Recommendations
- Randomized and Parameterized Algorithms for the Closest String Problem
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- scientific article; zbMATH DE number 1263250
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
- Randomized fixed-parameter algorithms for the closest string problem
- A recursive exact algorithm for the closest string problem
- scientific article; zbMATH DE number 710402
- Optimal parallel algorithms for string matching
- A constant-time optimal parallel string-matching algorithm
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
Parallel numerical computation (65Y05) Biochemistry, molecular biology (92C40) Systems biology, networks (92C42) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
Cited In (11)
- An optimization modelling for string selection in molecular biology using Pareto optimality
- A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
- Parallel metaheuristics: recent advances and new trends
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- Exact algorithm and heuristic for the closest string problem
- An improved integer linear programming formulation for the closest 0-1 string problem
- Improved optimization modelling for the closest string and related problems
- On some multiobjective optimization problems arising in biology
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem
- Efficient solutions for the far from most string problem
Uses Software
This page was built for publication: A parallel multistart algorithm for the closest string problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483510)
