SMOTER, A Structured Motif Finder Based on an Exhaustive Tree-Based Algorithm

ACE: accurate correction of errors using K-mer tries

“…We employ the K-mer trie, a data structure more time/space-efficient than the suffix trees employed in SHREC. K-mer tries have been effective in solving some bioinformatics problems (Brudno et al, 2003;Sheikhizadeh and Hosseini, 2014).…”