Local search for string problems: brute force is essentially optimal

DOI10.1007/978-3-642-38905-4_14MaRDI QIDQ4928567zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Local search for string problems: brute-force is essentially optimal
• Consequences of Faster Alignment of Sequences
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1305456
• Semi-local string comparison: algorithmic techniques and applications

Cited in

(1)

• Local search for string problems: brute-force is essentially optimal

This page was built for publication: Local search for string problems: brute force is essentially optimal

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