Augmenting Suffix Trees, with Applications

  • Yossi Matias
  • S. Muthukrishnan
  • Süleyman Cenk Sahinalp
  • Jacob Ziv
Conference paper

DOI: 10.1007/3-540-68530-8_6

Volume 1461 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Matias Y., Muthukrishnan S., Sahinalp S.C., Ziv J. (1998) Augmenting Suffix Trees, with Applications. In: Bilardi G., Italiano G.F., Pietracaprina A., Pucci G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Yossi Matias
    • 1
    • 2
  • S. Muthukrishnan
    • 2
  • Süleyman Cenk Sahinalp
    • 3
    • 4
  • Jacob Ziv
    • 5
  1. 1.Department of Computer ScienceTel-Aviv UniversityTel-AvivIsrael
  2. 2.Bell LabsMurray HillUSA
  3. 3.Department of Computer ScienceUniversity of WarwickCoventryUK
  4. 4.Center for BioInformaticsUniversity of PennsylvaniaPhiladelphiaUSA
  5. 5.Department of Electrical EngineeringTechnionHaifaIsrael