Efficient solutions for the far from most string problem
type: Item
instance of: scholarly article
title: Efficient solutions for the far from most string problem
zbMATH Open document ID: 1251.90317
author: Paola Festa
author: Panos M. Pardalos
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107376
zbMATH Keywords: computational biology
zbMATH Keywords: molecular structure prediction
zbMATH Keywords: protein and sequences alignment
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
describes a project that uses: GRASP
MaRDI profile type: Publication
full work available at URL: s10479-011-1028-7
OpenAlex ID: W2138481196
cites work: Probability distribution of solution time in GRASP: an experimental investigation
cites work: Q4258216
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: Heuristic procedures for solving the discrete ordered median problem
cites work: Q3517653
cites work: Q4058132
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: On some optimization problems in molecular biology
cites work: GRASP: An annoted bibliography
cites work: Genetic and hybrid algorithms for graph coloring
cites work: On covering problems of codes
cites work: Q4198056
cites work: Q4352217
cites work: Q4692508
cites work: A parallel multistart algorithm for the closest string problem
cites work: Multicriteria inventory classification using a genetic algorithm
cites work: Q4079017
cites work: Genetic programming III. Darwinian invention and problem solving
cites work: Q4252342
cites work: Distinguishing string selection problems.
cites work: Finding similar regions in many strings
cites work: Genetic algorithms: Foundations and applications
cites work: Optimal solutions for the closest-string problem via integer programming
cites work: Q4004140
cites work: A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
cites work: Genetic algorithms and network ring design
DOI: 10.1007/S10479-011-1028-7
Recommended article: On the Far from Most String Problem, One of the Hardest String Selection Problems
Recommended article: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
Recommended article: Q4474112
Recommended article: Optimal solutions for the closest-string problem via integer programming
Recommended article: More Efficient Algorithms for Closest String and Substring Problems
Recommended article: Algorithms for closest and farthest string problems via rank distance
Recommended article: Optimum Solution of the Closest String Problem via Rank Distance
description: scientific article; zbMATH DE number 6107376