seqtrie

cranv0.3.5

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) <https://stevehanov.ca/

License GPL-3strong copyleft0 versions1 maintainers6 deps57 weekly dl
traversc/seqtrie
37
/ 100
Health
use with caution

[email protected] low health (37/100) — consider alternatives

  • Low health score (37/100)
Health breakdown0 – 100
10/25
maintenance
0/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/seqtrie

First published · 2025-10-20 08:55:49

Last updated · 2025-10-20T07:00:02+00:00

seqtrie — Health Score 37/100 | DepScope