It's even sorrier if the trie you want to search doesn't fit into memory. There are compressed suffix trees, but at the time all I could find was a C++ implemen

It's even sorrier if the trie you want to search doesn't fit into memory. There are compressed suffix trees, but at the time all I could find was a C++ implementation[1] and I had to write my own bindings[2] using Cython. After figuring all that out, it turned out tries weren't very well suited the problem I wanted to solve. Oops. [1] http://www.cs.helsinki.fi/group/suds/cst http://www.cs.helsinki.fi/group/suds/cst [2] https://github.com/njbooher/boglab_OTSF/blob/master/sstree/sstree.pyx https://github.com/njbooher/boglab_OTSF/blob/master/sstree/s...