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)
- Version0.2.8
- R version≥ 3.5.0
- LicenseGPL-3
- Needs compilation?Yes
- Last release05/04/2024
Documentation
Team
Travers Ching
Martin Moene
Show author detailsRolesContributor, Copyright holderSteve Hanov
Show author detailsRolesContributorMartin Leitner-Ankerl
Show author detailsRolesContributor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Imports6 packages
- Suggests8 packages
- Linking To3 packages