Bit-parallel witnesses and their applications to approximate string matching

DOI10.1007/s00453-004-1108-zzbMath1069.68115OpenAlexW2070409660MaRDI QIDQ1763154

Gonzalo Navarro, Heikki Hyyrö

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/176171

zbMATH Keywords

sublinear-time exact algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (8)

On finding \(k\)-cliques in \(k\)-partite graphs ⋮ A new filtration method and a hybrid strategy for approximate string matching ⋮ Run-Length Encoded Nondeterministic KMP and Suffix Automata ⋮ Approximate all-pairs suffix/prefix overlaps ⋮ Faster approximate string matching for short patterns ⋮ Nested Counters in Bit-Parallel String Matching ⋮ Average-optimal string matching ⋮ BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS

This page was built for publication: Bit-parallel witnesses and their applications to approximate string matching