Suffix trays and suffix trists: Structures for faster text indexing

Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Suffix trees and suffix arrays are two of the most widely used data structures for text indexing. Each uses linear space and can be constructed in linear time [3,5,6,7]. However, when it comes to answering queries, the prior does so in O(m log |Σ|) time, where m is the query size, |Σ| is the alphabet size, and the latter does so in O(m + log n), where n is the text size. We propose a novel way of combining the two into, what we call, a suffix tray. The space and construction time remain linear and the query time improves to O(m + log |Σ|). We also consider the online version of indexing, where the indexing structure continues to update the text online and queries are answered in tandem. Here we suggest a suffix trist, a cross between a suffix tree and a suffix list. It supports queries in O(m+log |Σ|). The space and text update time of a suffix trist are the same as for the suffix tree or the suffix list.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings
PublisherSpringer Verlag
Pages358-369
Number of pages12
ISBN (Print)3540359044, 9783540359043
DOIs
StatePublished - 2006
Event33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 - Venice, Italy
Duration: Jul 10 2006Jul 14 2006

Publication series

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

Other

Other33rd International Colloquium on Automata, Languages and Programming, ICALP 2006
CountryItaly
CityVenice
Period7/10/067/14/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Suffix trays and suffix trists: Structures for faster text indexing'. Together they form a unique fingerprint.

Cite this