Efficient Algorithms for Shortest Partial Seeds in Words
From MaRDI portal
Publication:5165605
DOI10.1007/978-3-319-07566-2_20zbMath1387.68312OpenAlexW2176155695MaRDI QIDQ5165605
Solon P. Pissis, Tomasz Kociumaka, Tomasz Walen, Jakub Radoszewski, Wojciech Rytter
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
Related Items (2)
Efficient algorithms for shortest partial seeds in words ⋮ On approximate enhanced covers under Hamming distance
This page was built for publication: Efficient Algorithms for Shortest Partial Seeds in Words