Space-economical construction of index structures for all suffixes of a string

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa

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

4 Citations (Scopus)

Abstract

The minimum all-suffixes directed acyclic word graph (MASDAWG) of a string w has |w| + 1 initial nodes, where the dag induced by all reachable nodes from the k-th initial node conforms with the DAWG of the k-th suffix of w. A new space-economical algorithm for the construction of MASDAWG(w) is presented. The algorithm reads a given string w from right to left, and constructs MASDAWG(w) without suffix links. It performs in time linear in the output size. Furthermore, we introduce the minimum all-suffixes compact DAWG (MASCDAWG). CDAWGs are known to be more space-economical than DAWGs, and thus MASCDAWG(w) requires smaller space than MASDAWG(w). We present an on-line (right-to-left) algorithm to build MASCDAWG(w) without suffix links, whose running time is also linear in its size.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings
EditorsKrzysztof Diks, Wojciech Rytter, Wojciech Rytter
PublisherSpringer Verlag
Pages341-352
Number of pages12
ISBN (Print)3540440402, 9783540440406
DOIs
Publication statusPublished - Jan 1 2002
Event27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland
Duration: Aug 26 2002Aug 30 2002

Publication series

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

Other

Other27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002
CountryPoland
CityWarsaw
Period8/26/028/30/02

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Space-economical construction of index structures for all suffixes of a string'. Together they form a unique fingerprint.

Cite this