seqtrie0.3.5 package

Radix Tree and Trie-Based String Distances

dist_matrix

Compute distances between all combinations of two sets of sequences

dist_pairwise

Pairwise distance between two sets of sequences

dist_search

Distance search for similar sequences

generate_cost_matrix

Generate a simple cost matrix

RadixForest

RadixForest

RadixTree

RadixTree

split_search

split_search

Download source packageRead PDF manual

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

  • Maintainer: Travers Ching
  • License: GPL-3
  • Last published: 2025-10-20

Useful links