Tuning BNDM withq-Grams
From MaRDI portal
Publication:5233563
DOI10.1137/1.9781611972894.3zbMath1430.68459OpenAlexW4205906231MaRDI QIDQ5233563
Branislav Ďurian, Jan Holub, Jorma Tarhio, Hannu Peltola
Publication date: 11 September 2019
Published in: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611972894.3
Parallel algorithms in computer science (68W10) Protein sequences, DNA sequences (92D20) Natural language processing (68T50) Algorithms on strings (68W32)
Related Items
Fast and flexible packed string matching ⋮ Faster string matching based on hashing and bit-parallelism ⋮ Unnamed Item
This page was built for publication: Tuning BNDM withq-Grams