Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version
Go to top

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

, 14 Nov 2010
One of the best methods for solving approximate string matching problem

Statistics


License

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

Share

About the Author

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

| Advertise | Privacy | Mobile
Web01 | 2.8.140916.1 | Last Updated 15 Nov 2010
Article Copyright 2010 by Dima Statz
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid