Click here to Skip to main content
15,884,176 members
Articles / General Programming / Algorithms

Approximate String Matching - Row-wise Bit-parallelism Algorithm (BPR)

Rate me:
Please Sign up or sign in to vote.
4.67/5 (8 votes)
14 Nov 2010CPOL2 min read 31.3K   30  
One of the best methods for solving approximate string matching problem

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Retired
Israel Israel
Name: Statz Dima
Fields of interest: software

Comments and Discussions