A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees

Abstract

Suffix trees are the fundamental data structure of combinatorial pattern matching on words. Suffix trees have been used in order to give optimal solutions to a great variety of problems on static words, but for practical situations, such as in a text editor, where the incremental changes of the text make dynamic updating of the corresponding suffix trees… (More)
DOI: 10.1007/s00453-003-1034-5

Topics

2 Figures and Tables

Slides referencing similar topics