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]
@article{Ayala-RinconC03,
title = {A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees},
author = {Mauricio Ayala-Rincón and Paulo D. Conejo},
year = {2003},
doi = {10.1007/s00453-003-1034-5},
url = {http://dx.doi.org/10.1007/s00453-003-1034-5},
researchr = {https://researchr.org/publication/Ayala-RinconC03},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {37},
number = {3},
pages = {233-241},
}