Skip to content

volpato30/hamming-d-search

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Inspire by Steve Hanov's Blog

Build a Trie where each vectice is an amino acid and the leaf represent a peptide. This structure enables us to do fast hamming distance d query with a customized distance function. For example ignoring the difference between "I" and "L"

About

Trie structure for fast hamming distance search

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages