seqtrie

Last update 3 June 2026

Copyright license GNU General Public License, version 3.0

Software version identifier 0.2.5, 0.2.6, PACKAGES.rds, 0.2.8, 0.2.9, 0.3.5, 0.4.0

Description

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>. It also includes a modified version of the Starcode all-pairs search algorithm (Zorita, Cuscó, and Filion 2015) <doi:10.1093/bioinformatics/btv053>.

Cites work

Starcode: sequence clustering based on all-pairs search

This page was built for software: seqtrie