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
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

Fingerprint

Suffix
Strings
Graph in graph theory
Vertex of a graph
Linear Time

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Inenaga, S., Shinohara, A., Takeda, M., Bannai, H., & Arikawa, S. (2002). Space-economical construction of index structures for all suffixes of a string. In K. Diks, W. Rytter, & W. Rytter (Eds.), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings (pp. 341-352). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2420). Springer Verlag.

Space-economical construction of index structures for all suffixes of a string. / Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki; Bannai, Hideo; Arikawa, Setsuo.

Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. ed. / Krzysztof Diks; Wojciech Rytter; Wojciech Rytter. Springer Verlag, 2002. p. 341-352 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2420).

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

Inenaga, S, Shinohara, A, Takeda, M, Bannai, H & Arikawa, S 2002, Space-economical construction of index structures for all suffixes of a string. in K Diks, W Rytter & W Rytter (eds), Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2420, Springer Verlag, pp. 341-352, 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, Warsaw, Poland, 8/26/02.
Inenaga S, Shinohara A, Takeda M, Bannai H, Arikawa S. Space-economical construction of index structures for all suffixes of a string. In Diks K, Rytter W, Rytter W, editors, Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Springer Verlag. 2002. p. 341-352. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Inenaga, Shunsuke ; Shinohara, Ayumi ; Takeda, Masayuki ; Bannai, Hideo ; Arikawa, Setsuo. / Space-economical construction of index structures for all suffixes of a string. Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. editor / Krzysztof Diks ; Wojciech Rytter ; Wojciech Rytter. Springer Verlag, 2002. pp. 341-352 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2b6de07a366d409da886ef1aaa72fd2f,
title = "Space-economical construction of index structures for all suffixes of a string",
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.",
author = "Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda and Hideo Bannai and Setsuo Arikawa",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "3540440402",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "341--352",
editor = "Krzysztof Diks and Wojciech Rytter and Wojciech Rytter",
booktitle = "Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Bannai, Hideo

AU - Arikawa, Setsuo

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84956991457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956991457&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540440402

SN - 9783540440406

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 341

EP - 352

BT - Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings

A2 - Diks, Krzysztof

A2 - Rytter, Wojciech

A2 - Rytter, Wojciech

PB - Springer Verlag

ER -