seqtrie

Radix Tree and Trie-Based String Distances

CRAN Package

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) http://stevehanov.ca/blog/index.php?id=114.

  • Version0.2.8
  • R versionunknown
  • LicenseGPL-3
  • Needs compilation?Yes
  • Last release05/04/2024

Documentation

Team

Insights

Last 30 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.

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

  • Imports6 packages
  • Suggests6 packages
  • Linking To3 packages