Local Search for String Problems: Brute Force Is Essentially Optimal

DOI10.1007/978-3-642-38905-4_14zbMath1381.68314OpenAlexW2173061445MaRDI QIDQ4928567

Jiong Guo, Danny Hermelin, Christian Komusiewicz

Publication date: 14 June 2013

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_14

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithms on strings (68W32)

This page was built for publication: Local Search for String Problems: Brute Force Is Essentially Optimal