Radix Tree and Trie-Based String Distances R package seqtrie version 0.4.0 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>. It also includes a modified version of the Starcode all-pairs search algorithm (Zorita, Cuscó, and Filion 2015) <doi:10.1093/bioinformatics/btv053>. Software Depends: R (>= 3.5.0) Imports: Rcpp (>= 0.12.18.3), RcppParallel (>= 5.1.3), R6, S7 LinkingTo: Rcpp, RcppParallel Suggests: knitr, rmarkdown, pwalign, igraph, ggplot2 Travers Ching <traversc@gmail.com> Comprehensive R Archive Network (CRAN) 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), Eduard Zorita [ctb] (Starcode algorithm and publication), Pol Cuscó [ctb] (Starcode algorithm and publication), Guillaume J. Filion [ctb] (Starcode algorithm and publication) GPL-3 2026-06-03 application/tgz https://CRAN.R-project.org/package=seqtrie doi:10.32614/CRAN.package.seqtrie