Augmenting suffix trees, with applications

Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one algorithmic problem from each of these areas and present highly efficient (linear or near linear time) algorithms for both problems. Our algorithms rely on augmenting the suffix tree, a fundamental data structure in string algorithmics. The augmentations are nontrivial and they form the technical crux of this paper. In particular, they consist of adding extra edges to suffix trees, resulting in Directed Acyclic Graphs (DAGs). Our algorithms construct these "suffix DAGs" and manipulate them to solve the two problems efficiently.

Original languageEnglish
Title of host publicationAlgorithms, ESA 1998 - 6th Annual European Symposium, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540648488, 9783540648482
StatePublished - 1998
Event6th Annual European Symposium on Algorithms, ESA 1998 - Venice, Italy
Duration: 24 Aug 199826 Aug 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1461 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th Annual European Symposium on Algorithms, ESA 1998


Dive into the research topics of 'Augmenting suffix trees, with applications'. Together they form a unique fingerprint.

Cite this