{"package":"seqtrie","ecosystem":"cran","latest_version":"0.3.5","description":"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-3","license_risk":"strong_copyleft","commercial_use_notes":"GPL-3.0: derivative works must release source under GPL; includes explicit patent grant.","homepage":"https://github.com/traversc/seqtrie","repository":"https://github.com/traversc/seqtrie","downloads_weekly":57,"health":{"score":37,"risk":"critical","breakdown":{"maintenance":10,"popularity":0,"security":25,"maturity":0,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"0.3.5","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2025-10-20 08:55:49","last_published":"2025-10-20T07:00:02+00:00","dependencies_count":6,"dependencies":["Rcpp","RcppParallel","R6","rlang","dplyr","stringi"]},"github_stats":null,"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"use_with_caution","issues":["Low health score (37/100)"],"use_version":"0.3.5","version_hint":null,"summary":"seqtrie@0.3.5 low health (37/100) — consider alternatives"},"version_scoped":null,"requested_version":null,"_cache":"hit","_response_ms":0,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":false},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}