By using our services, you agree to our Privacy Policy. Click to accept.

Incrementally developing and implementing Hirschberg's longest common subseqence algorithm using Lua

Robin Snyder

The longest common subsequnce (LCS) problem is a dual problem of the shortest edit distance (SED) problem. The solution to these problems are used in open source file comparison tools such as WinMerge and DiffMerge. In 1974, Hirshberg published a reasonably space and time efficient solution to these problems. This talk will cover the incremental development and implementation of Hirshberg's algorithm in Lua, including trade-offs and design decisions along the way. The final algorithm implementation can be used for customized comparsion of files, or other applications, as needed.

Share on FacebookShare on TwitterShare on PinterestShare on RedditShare on TumblrShare on VkontakteShare on LinkedinShare on BloggerShare on Telegram
Copy URL
By using our services, you agree to our Privacy Policy.
Alternative random YouTube videos generator: vTomb
Powered by Wildsbet.

YoutuBeRandom © 2022