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]

Authors

Mauricio Ayala-Rincón

This author has not been identified. Look up 'Mauricio Ayala-Rincón' in Google

Paulo D. Conejo

This author has not been identified. Look up 'Paulo D. Conejo' in Google