Fast Convolutions and Their Applications in Approximate String Matching
From MaRDI portal
Publication:3651551
DOI10.1007/978-3-642-10217-2_26zbMath1267.68327OpenAlexW1554198395MaRDI QIDQ3651551
Szymon Grabowski, Kimmo Fredriksson
Publication date: 11 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_26
Related Items
On pattern matching with \(k\) mismatches and few don't cares, Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching