A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees

Mauricio Ayala-Rincón, Paulo D. Conejo. A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. Algorithmica, 37(3):233-241, 2003. [doi]

Abstract

Abstract is missing.