Nothing
seqtrie: Radix Tree and Trie-Based String Distances
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) <https://stevehanov.ca/blog/index.php?id=114>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Travers Ching [aut, cre, cph], Martin Moene [ctb, cph] (span-lite C++ library), Steve Hanov [ctb] (Trie levenshtein implementation in Python), Martin Leitner-Ankerl [ctb] (Ankerl unordered dense hashmap) |
| Maintainer | Travers Ching <traversc@gmail.com> |
| License | GPL-3 |
| Version | 0.2.9 |
| URL | https://github.com/traversc/seqtrie |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the seqtrie package in your browser
Any scripts or data that you put into this service are public.
