On the far from most string problem, one of the hardest string selection problems

DOI10.1007/978-3-319-10046-3_7MaRDI QIDQ5253264zbMATH OpenOpenAlexWikidataFDO

Authors Daniele Ferone, Paola Festa, Mauricio G. C. Resende

Publication date 4 June 2015

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10046-3_7

zbMATH Keywords

combinatorial optimizationmetaheuristicscomputational biologyconsensusstring selectionmolecular structure prediction

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Recommendations

• Efficient solutions for the far from most string problem
• scientific article; zbMATH DE number 1305456
• Exact algorithm and heuristic for the closest string problem
• Distinguishing string selection problems.
• Hybridizations of GRASP with path relinking for the far from most string problem

Cited in

(7)

• Efficient solutions for the far from most string problem
• Hybridizations of GRASP with path relinking for the far from most string problem
• An optimization modelling for string selection in molecular biology using Pareto optimality
• On Hardness of Several String Indexing Problems
• Distinguishing string selection problems.
• Optimization approaches for solving string selection problems
• scientific article; zbMATH DE number 1305456 (Why is no real title available?)

This page was built for publication: On the far from most string problem, one of the hardest string selection problems

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