# The edit-distance-vector package

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]

## Properties

Versions | 1.0, 1.0.0.1, 1.0.0.2, 1.0.0.3, 1.0.0.4 |
---|---|

Change log | CHANGELOG.md |

Dependencies | base (>=4.5 && <5.0), vector (>=0.8) [details] |

License | BSD3 |

Copyright | (c) 2015 Thomas Sutton and others. |

Author | Thomas Sutton |

Maintainer | me@thomas-sutton.id.au |

Category | Data, Data Structures, Algorithms |

Home page | https://github.com/thsutton/edit-distance-vector |

Bug tracker | https://github.com/thsutton/edit-distance-vector/issues |

Source repository | head: git clone https://github.com/thsutton/edit-distance-vector |

Uploaded | Tue May 24 03:49:20 UTC 2016 by ThomasSutton |

Distributions | LTSHaskell:1.0.0.4, NixOS:1.0.0.4, Stackage:1.0.0.4, Tumbleweed:1.0.0.4 |

Downloads | 649 total (19 in the last 30 days) |

Votes | |

Status | Docs available [build log] Last success reported on 2016-05-24 [all 1 reports] |

## Downloads

- edit-distance-vector-1.0.0.4.tar.gz [browse] (Cabal source package)
- Package description (included in the package)