No, I don't think you didn't misread the paper, but the suffix trie is not the same as the suffix tree or suffix array. I thought it had to be corrected, in case someone reads the post and misunderstands it, sorry about that.
I have to find all ready that match with no mismatch. I'd be interested in your code.
In reply to Re^6: Is it possible to make reference to substrings and sort them?
by spooknick
in thread Is it possible to make reference to substrings and sort them?
by spooknick
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |