A Lower Bound on Approximation Algorithms for the Closest Substring Problem

DOI10.1007/978-3-540-73556-4_31zbMATH Open1175.68564OpenAlexW1547653952MaRDI QIDQ3611982

Min Huang, Jianxin Wang, Jianer Chen

Publication date: 3 March 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73556-4_31

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

LP-based heuristics for the distinguishing string and substring selection problems

This page was built for publication: A Lower Bound on Approximation Algorithms for the Closest Substring Problem

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