Click here to Skip to main content

Simple parallelizable algorithm for approximate pattern matching using suffix tree

Ivan Yakimov

Rate me:

3.14/5 (4 votes)

19 Nov 2017CPOL7 min read

9.7K

2

In this article, I'd like to show a simple algorithm for approximate pattern matching.

Views

Daily Counts

License

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

Written By

Ivan Yakimov

Software Developer (Senior) Finstek

China

This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions

Go to top