2 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014★ 1 cited
Most Recent Match Queries in On-Line Suffix Trees (with appendix)
N. Jesper Larsson
A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some a…
cs.DS2014★ 2 cited
Efficient Representation for Online Suffix Tree Construction
N. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson
Suffix tree construction algorithms based on suffix links are popular because they are simple to implement, can operate online in linear time, and because the suffix links are ofte…