Efficient solutions for the far from most string problem

DOI10.1007/S10479-011-1028-7zbMATH Open1251.90317OpenAlexW2138481196MaRDI QIDQ1761847FDOQ1761847

Paola Festa, Panos M. Pardalos

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1028-7

zbMATH Keywords

combinatorial optimizationmetaheuristicscomputational biologymolecular structure predictionprotein and sequences alignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Distinguishing string selection problems.
• Optimal solutions for the closest-string problem via integer programming
• On covering problems of codes
• Multicriteria inventory classification using a genetic algorithm
• Genetic programming III. Darwinian invention and problem solving
• GRASP: An annoted bibliography
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• Probability distribution of solution time in GRASP: an experimental investigation
• Finding similar regions in many strings
• On some optimization problems in molecular biology
• Genetic and hybrid algorithms for graph coloring
• Genetic algorithms: Foundations and applications
• Heuristic procedures for solving the discrete ordered median problem
• A parallel multistart algorithm for the closest string problem
• A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
• Genetic algorithms and network ring design

Cited In (5)

• On approximating string selection problems with outliers
• Local search for string problems: brute-force is essentially optimal
• Application of negative learning ant colony optimization to the far from most string problem
• A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem
• A nonmonotone GRASP

Uses Software

• GRASP

Recommendations

• Title not available (Why is that?) 👍 👎
• Optimal solutions for the closest-string problem via integer programming 👍 👎
• More Efficient Algorithms for Closest String and Substring Problems 👍 👎
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems 👍 👎
• Algorithms for closest and farthest string problems via rank distance 👍 👎
• On the Far from Most String Problem, One of the Hardest String Selection Problems 👍 👎
• Optimum Solution of the Closest String Problem via Rank Distance 👍 👎

This page was built for publication: Efficient solutions for the far from most string problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761847)