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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.3.5 |
rolling linux/jammy R-4.5 | seqtrie_0.3.5.tar.gz |
1.3 MiB |
0.3.5 |
rolling linux/noble R-4.5 | seqtrie_0.3.5.tar.gz |
1.3 MiB |
0.3.5 |
rolling source/ R- | seqtrie_0.3.5.tar.gz |
955.2 KiB |
0.3.5 |
latest linux/jammy R-4.5 | seqtrie_0.3.5.tar.gz |
1.3 MiB |
0.3.5 |
latest linux/noble R-4.5 | seqtrie_0.3.5.tar.gz |
1.3 MiB |
0.3.5 |
latest source/ R- | seqtrie_0.3.5.tar.gz |
955.2 KiB |
0.3.5 |
2026-04-26 source/ R- | seqtrie_0.3.5.tar.gz |
955.2 KiB |
0.3.5 |
2026-04-23 source/ R- | seqtrie_0.3.5.tar.gz |
955.2 KiB |
0.3.5 |
2026-04-09 windows/windows R-4.5 | seqtrie_0.3.5.zip |
1.7 MiB |
0.2.9 |
2025-04-20 source/ R- | seqtrie_0.2.9.tar.gz |
974.7 KiB |