Dynamic suffix tree and two-dimensional texts management

This paper contains two results. First, it gives a new implementation of a dynamic suffix tree, which can manage a set of strings in a space conserving manner. Second, it presents an improved data structure for storing, searching and updating a library of two-dimensional texts. This result improves the previously best scheme, the s-trees of Giancarlo (1993), as regards the time complexity of both the search and the update operations. In particular, the search operation is as fast as that of the best static solution (which assumes the texts are fixed). © 1997 Published by Elsevier Science B.V.link_to_subscribed_fulltex