Faster Compressed Suffix Trees for Repetitive Text Collections

  • Gonzalo Navarro
  • Alberto Ordóñez
Conference paper

DOI: 10.1007/978-3-319-07959-2_36

Volume 8504 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Navarro G., Ordóñez A. (2014) Faster Compressed Suffix Trees for Repetitive Text Collections. In: Gudmundsson J., Katajainen J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham

Abstract

Recent compressed suffix trees targeted to highly repetitive text collections reach excellent compression performance, but operation times in the order of milliseconds. We design a new suffix tree representation for this scenario that still achieves very low space usage, only slightly larger than the best previous one, but supports the operations within microseconds. This puts the data structure in the same performance level of compressed suffix trees designed for standard text collections, which on repetitive collections use many times more space than our new structure.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Gonzalo Navarro
    • 1
  • Alberto Ordóñez
    • 2
  1. 1.Dept. of Computer ScienceUniv. of ChileChile
  2. 2.Lab. de Bases de DatosUniv. da CoruñaSpain