A GRASP algorithm for the closest string problem using a probability-based heuristic
From MaRDI portal
Publication:1761970
DOI10.1016/j.cor.2011.02.025zbMath1251.90332OpenAlexW2024083574MaRDI QIDQ1761970
Sayyed Rasoul Mousavi, Navid Nasr Esfahani
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.025
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20)
Related Items
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, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On covering problems of codes
- Combinatorial pattern matching. 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5--7, 2004. Proceedings.
- An improved lower bound on approximation algorithms for the closest substring problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Distinguishing string selection problems.
- Greedy randomized adaptive search procedures
- A parallel multistart algorithm for the closest string problem
- Ant colony optimization theory: a survey
- On some optimization problems in molecular biology
- Finding similar regions in many strings
- Optimal Solutions for the Closest-String Problem via Integer Programming
- On the closest string and substring problems
- An annotated bibliography of GRASP – Part I: Algorithms
- Encyclopedia of Algorithms
- Fundamentals of Computation Theory
