CRAN/E | seqtrie

seqtrie

Radix Tree and Trie-Based String Distances

Installation

About

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

github.com/traversc/seqtrie
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.
System requirements GNU make
Bug report File report

Key Metrics

Version 0.2.6
R ≥ 3.5.0
Published 2024-01-27 91 days ago
Needs compilation? yes
License GPL-3
CRAN checks seqtrie results

Downloads

Yesterday 6 0%
Last 7 days 26 -40%
Last 30 days 144 -16%
Last 90 days 541 -10%
Last 365 days 1.464

Maintainer

Maintainer

Travers Ching

traversc@gmail.com

Authors

Travers Ching

aut / cre / cph

Martin Moene

ctb / cph

(span-lite C++ library)

Hanov Steve

ctb

(Trie levenshtein implementation in Python)

Material

README
ChangeLog
Reference manual
Package source

Vignettes

seqtrie

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

seqtrie archive

Depends

R ≥ 3.5.0

Imports

Rcpp ≥ 0.12.18.3
RcppParallel ≥ 5.1.3
R6
rlang
dplyr
stringi

Suggests

knitr
rmarkdown
stringdist
qs
Biostrings
igraph
ggplot2

LinkingTo

Rcpp
RcppParallel
BH