TY - GEN
T1 - Local search for string problems
T2 - 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013
AU - Guo, Jiong
AU - Hermelin, Danny
AU - Komusiewicz, Christian
PY - 2013/9/24
Y1 - 2013/9/24
N2 - We address the problem of whether the brute-force procedure for the local improvement step in a local search algorithm can be substantially improved when applied to classical NP-hard string problems. We examine four problems in this domain: Closest String, Longest Common Subsequence, Shortest Common Supersequence, and Shortest Common Superstring. Herein, we consider arguably the most fundamental string distance measure, namely the Hamming distance, which has been applied in practical local search implementations for string problems. Our results indicate that for all four problems, the brute-force algorithm is essentially optimal.
AB - We address the problem of whether the brute-force procedure for the local improvement step in a local search algorithm can be substantially improved when applied to classical NP-hard string problems. We examine four problems in this domain: Closest String, Longest Common Subsequence, Shortest Common Supersequence, and Shortest Common Superstring. Herein, we consider arguably the most fundamental string distance measure, namely the Hamming distance, which has been applied in practical local search implementations for string problems. Our results indicate that for all four problems, the brute-force algorithm is essentially optimal.
UR - http://www.scopus.com/inward/record.url?scp=84884331704&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-38905-4_14
DO - 10.1007/978-3-642-38905-4_14
M3 - Conference contribution
SN - 9783642389047
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 130
EP - 141
BT - Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings
Y2 - 17 June 2013 through 19 June 2013
ER -