Sciweavers

STOC
2000
ACM
117views Algorithms» more  STOC 2000»
13 years 8 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan