Efficient solutions for the far from most string problem

DOI10.1007/S10479-011-1028-7MaRDI QIDQ1761847zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the far from most string problem, one of the hardest string selection problems
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• scientific article; zbMATH DE number 2081011
• Optimal solutions for the closest-string problem via integer programming
• More efficient algorithms for closest string and substring problems
• Algorithms for closest and farthest string problems via rank distance
• Optimum Solution of the Closest String Problem via Rank Distance

Cites work

• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305456 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A parallel multistart algorithm for the closest string problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
• A specialized branching and fathoming technique for the longest common subsequence problem
• Distinguishing string selection problems.
• Finding similar regions in many strings
• GRASP: An annoted bibliography
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Genetic algorithms and network ring design
• Genetic algorithms: Foundations and applications
• Genetic and hybrid algorithms for graph coloring
• Genetic programming III. Darwinian invention and problem solving
• Greedy randomized adaptive search procedures
• Heuristic procedures for solving the discrete ordered median problem
• Multicriteria inventory classification using a genetic algorithm
• On covering problems of codes
• On some optimization problems in molecular biology
• Optimal solutions for the closest-string problem via integer programming
• Probability distribution of solution time in GRASP: an experimental investigation

Cited in

(8)

• On approximating string selection problems with outliers
• 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
• Local search for string problems: brute-force is essentially optimal
• Application of negative learning ant colony optimization to the far from most string problem
• Hybridizations of GRASP with path relinking for the far from most string problem
• On the far from most string problem, one of the hardest string selection problems
• A nonmonotone GRASP

Describes a project that uses

Uses Software

• GRASP

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)