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. 233-241 2003 37 Algorithmica 3 http://dx.doi.org/10.1007/s00453-003-1034-5 db/journals/algorithmica/algorithmica37.html#Ayala-RinconC03