9 Nov
2013
9 Nov
'13
1:12 a.m.
----- Original Message -----
I reworked both the algorithms and the interface. https://github.com/erikerlandson/edit_distance
Under such conditions, I've been comparing two similar sequences with 100 million elements in under a second.
Nope, more egg on face. For arbitrary cost function, I'm computing fast approximation of minimum edit path, not true minimum.