Bit-parallel witnesses and their applications to approximate string matching
From MaRDI portal
Publication:1763154
DOI10.1007/s00453-004-1108-zzbMath1069.68115MaRDI QIDQ1763154
Publication date: 21 February 2005
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/176171
Related Items
On finding \(k\)-cliques in \(k\)-partite graphs, A new filtration method and a hybrid strategy for approximate string matching, Approximate all-pairs suffix/prefix overlaps, Faster approximate string matching for short patterns, Average-optimal string matching, Run-Length Encoded Nondeterministic KMP and Suffix Automata, BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS, Nested Counters in Bit-Parallel String Matching