Installation
About
A collection of Radix Tree and Trie algorithms for finding similar sequences and calculating sequence distances (Levenshtein and other distance metrics). This work was inspired by a trie implementation in Python: "Fast and Easy Levenshtein distance using a Trie." Hanov (2011)
Key Metrics
Downloads
Yesterday | 6 0% |
Last 7 days | 26 -40% |
Last 30 days | 144 -16% |
Last 90 days | 541 -10% |
Last 365 days | 1.464 |