Closed donikv closed 4 years ago
@Martinsos yeah, unfortunately at their current speed, infix and global algorithms are slower than edlib. On the other hand, performance improvements of the prefix algorithm are quite good, please check them out in the results section in the paper: https://github.com/donikv/Zavrsni_Rad/blob/master/Paper/zavrsni.pdf. Also I will remove the unnecessary perf_test scripts, I actually planned to do that before I opened this PR, but I forgot.
No prob thx I will check it out! Let me know when you are ready for another round of review.
Hey @donikv, hope you are doing well! How is the status, do you think we could end up merging this some time soon?
Hey @Martinsos, yeah sorry I had a lot of things I had to do for collage last few weeks. I was hoping to get it done by the end of the week.
No problem, just checking if it still on!
I will close this one for now since so much time passed, but we can reopen it if there will be interest.
The implementation of the Landau-Vishkin algorithm, integrated into edlib, for calculating prefix edit distance. Please note that test scripts have been modified but cannot be used as is (hradcoded path to original implementation)