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

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

, 14 Nov 2010 CPOL
One of the best methods for solving approximate string matching problem
No downloads associated with this content

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

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 | Terms of Use | Mobile
Web04 | 2.8.150414.1 | Last Updated 15 Nov 2010
Article Copyright 2010 by Dima Statz
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid