A linear time lower bound on updating algorithms for suffix trees | IEEE Conference Publication | IEEE Xplore