Quote: for patterns that fit in a computer word, fast, bit-parallel string matching based on the Shift-Or algorithm; optimal average and worst case running times; variation for Shift-Add algorithm and Hamming distance

Quotation Skeleton

We develop a new exact bit-parallel string matching … into a single computer word, this algorithm has … m and .rho. are the sizes of the … The experimental results show that our algorithm is … BNDM (Navarro & Raffinot, 2000) family of algorithms. … obtaining optimal time for searching under Hamming distance. …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: search algorithms (40 items)