Efficient Algorithms for Shortest Partial Seeds in Words

DOI10.1007/978-3-319-07566-2_20MaRDI QIDQ5165605zbMATH OpenOpenAlexFDO

Authors Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń

Publication date 30 June 2014

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

Full work available at URL https://kclpure.kcl.ac.uk/portal/en/publications/efficient-algorithms-for-shortest-partial-seeds-in-words(16905461-339c-4486-b01e-341ae52f466a).html

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Efficient algorithms for shortest partial seeds in words
• Fast Algorithm for Partial Covers in Words
• Fast algorithm for partial covers in words
• Automata, Languages and Programming
• Optimal spaced seeds for faster approximate string matching
• A fast algorithm finding the shortest reset words
• Algorithmic combinatorics on partial words
• Periodicity algorithms for partial words
• Efficient Approximate Wordlength Optimization
• Efficient seeds computation revisited

Cited in

(4)

• Efficient algorithms for shortest partial seeds in words
• On approximate enhanced covers under Hamming distance
• Fast Algorithm for Partial Covers in Words
• Fast algorithm for partial covers in words

This page was built for publication: Efficient Algorithms for Shortest Partial Seeds in Words

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