On the Far from Most String Problem, One of the Hardest String Selection Problems

DOI10.1007/978-3-319-10046-3_7zbMath1362.92005OpenAlexW289511458WikidataQ62047869 ScholiaQ62047869MaRDI QIDQ5253264

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)

This page was built for publication: On the Far from Most String Problem, One of the Hardest String Selection Problems