At last, I have implemented the edit distance.
It was not that hard after all. Thanks to some of my training mates for helping me out understand what was written in Steven Skiena’s book. I am really slow in comprehending things.
I have to fully understand other dynamic programming algorithms.
Tag Archives: dynamic programming
Edit Distance, implemented!
14-Sep-09Edit Distance, Least Common Subsequence
10-Sep-09Yesterday after a whole day of volunteering to a certain annual IT event, we had our lecture on dynamic programming. We specifically tackled the usual Fibonacci sequence and binomial coefficients. Those few topics were relatively easier than the next problems; edit distance, least common subsequence, least increasing subsequence among others.
Those topics blew my mind. I [...]