Implementation of a modified Trie datastructure where duplicate letters posses a "count" that increments when a character matches the current node. This is a slow n' preliminary proof of concept that will be optimized to potentially be used in the IgDiscover pipeline, (https://www.nature.com/articles/ncomms13642) courtesey of Ben Murrell @ Karolinska institutet
-
Notifications
You must be signed in to change notification settings - Fork 0
Implementation of a modified Trie datastructure where duplicate letters posses a "count" that increments when a character matches the current node.
License
Qile0317/FreqTrie.jl
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of a modified Trie datastructure where duplicate letters posses a "count" that increments when a character matches the current node.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published