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) <>.

Version: 0.2.6
Depends: R (≥ 3.5.0)
Imports: Rcpp (≥, RcppParallel (≥ 5.1.3), R6, rlang, dplyr, stringi
LinkingTo: Rcpp, RcppParallel, BH
Suggests: knitr, rmarkdown, stringdist, qs, Biostrings, igraph, ggplot2
Published: 2024-01-27
Author: Travers Ching [aut, cre, cph], Martin Moene [ctb, cph] (span-lite C++ library), Hanov Steve [ctb] (Trie levenshtein implementation in Python)
Maintainer: Travers Ching <traversc at>
License: GPL-3
Copyright: This package includes code from the 'span-lite' library owned by Martin Moene under Boost Software License 1.0. This package contains data derived from Adaptive Biotechnologies "ImmuneCODE" dataset under Creative Commons Attribution 4.0.
NeedsCompilation: yes
SystemRequirements: GNU make
Materials: README ChangeLog
CRAN checks: seqtrie results


Reference manual: seqtrie.pdf
Vignettes: seqtrie


Package source: seqtrie_0.2.6.tar.gz
Windows binaries: r-prerel:, r-release:, r-oldrel:
macOS binaries: r-prerel (arm64): seqtrie_0.2.6.tgz, r-release (arm64): seqtrie_0.2.6.tgz, r-oldrel (arm64): seqtrie_0.2.6.tgz, r-prerel (x86_64): seqtrie_0.2.6.tgz, r-release (x86_64): seqtrie_0.2.6.tgz
Old sources: seqtrie archive


Please use the canonical form to link to this page.