A Linear Time Lower Bound on Updating Algorithms for Suffix Trees.

@inproceedings{ayalarincon-1998-linear, author = {Mauricio Ayala-Rinc\'{o}n and Paulo D. Conejo}, title = {{A Linear Time Lower Bound on Updating Algorithms for Suffix Trees}}, booktitle = {{String Processing and Information Retrieval: A South American Symposium, SPIRE 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998}}, pages = {1--6}, publisher = {IEEE Computer Society}, year = {1998}, url = {https://doi.org/10.1109/SPIRE.1998.712976}, doi = {https://doi.org/10.1109/SPIRE.1998.712976} }