Multipattern string matching with q -grams
From MaRDI portal
Publication:3507759
DOI10.1145/1187436.1187438zbMath1140.68542OpenAlexW1970659131MaRDI QIDQ3507759
Jorma Tarhio, Leena Salmela, Jari Kytöjoki
Publication date: 20 June 2008
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1187436.1187438
Related Items (5)
A weak approach to suffix automata simulation for exact and approximate string matching ⋮ A compact representation of nondeterministic (suffix) automata for the bit-parallel approach ⋮ Average complexity of backward \(q\)-gram string matching algorithms ⋮ On the string matching with \(k\) mismatches ⋮ Fast parameterized matching with \(q\)-grams
This page was built for publication: Multipattern string matching with q -grams