2 ms·
This appears to be just reinvention of known algorithms on suffix trees. I recommend (and recommended as a comment on the original article) Dan Gusfield's book
by rickbradley 12y ago
This appears to be just reinvention of known algorithms on suffix trees. I recommend (and recommended as a comment on the original article) Dan Gusfield's book "Algorithms on Strings, Trees, and Sequences" which does a pretty thorough job of covering the relevant algorithms and data structures.
- willvarfar 12y agoThe GADDAG is a standard datastructure - the original paper, linked from the article, is from 1994. The article doesn't pretend to invent the GADDAG, nor claim to compress it better than others, only to try and explain how to simplify and pack a GADDAG. The steps would work on all DAGs generally. This is nothing new, but hopefully its new to some of us and a nice article.