Improved optimization modelling for the closest string and related problems

DOI10.1016/j.apm.2011.05.015zbMath1228.90056OpenAlexW2031277014MaRDI QIDQ651767

Peter Zörnig

Publication date: 18 December 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.05.015

zbMATH Keywords

modellingmathematical programmingcomputational biologyclosest string problemmotif finding

Mathematics Subject Classification ID

Integer programming (90C10) Protein sequences, DNA sequences (92D20)

Cites Work

• Unnamed Item
• An optimization modelling for string selection in molecular biology using Pareto optimality
• On covering problems of codes
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Distinguishing string selection problems.
• A parallel multistart algorithm for the closest string problem
• On some optimization problems in molecular biology
• Optimal Solutions for the Closest-String Problem via Integer Programming
• On some multiobjective optimization problems arising in biology
• On the closest string and substring problems

This page was built for publication: Improved optimization modelling for the closest string and related problems