edit-distance-vector: Calculate edit distances and edit scripts between vectors.
An implementation of the Wagner–Fischer dynamic programming algorithm to find the optimal edit script and cost between two sequences.
The implementation in this package is specialised to sequences represented with Data.Vector but is otherwise agnostic to:
The type of values in the vectors;
The type representing edit operations; and
The type representing the cost of operations.
[Skip to Readme]
|Versions [RSS]||1.0, 22.214.171.124, 126.96.36.199, 188.8.131.52, 184.108.40.206|
|Dependencies||base (>=4.5 && <5.0), vector (>=0.8) [details]|
|Copyright||(c) 2015 Thomas Sutton and others.|
|Category||Data, Data Structures, Algorithms|
|Source repo||head: git clone https://github.com/thsutton/edit-distance-vector|
|Uploaded||by ThomasSutton at 2016-05-24T03:49:20Z|
|Distributions||Arch:220.127.116.11, Debian:18.104.22.168, LTSHaskell:22.214.171.124, NixOS:126.96.36.199, Stackage:188.8.131.52|
|Reverse Dependencies||3 direct, 8 indirect [details]|
|Downloads||6618 total (24 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2016-05-24 [all 1 reports]