### 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 language | English |
---|---|

Title of host publication | Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings |

Editors | Krzysztof Diks, Wojciech Rytter, Wojciech Rytter |

Publisher | Springer Verlag |

Pages | 341-352 |

Number of pages | 12 |

ISBN (Print) | 3540440402, 9783540440406 |

Publication status | Published - Jan 1 2002 |

Event | 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland Duration: Aug 26 2002 → Aug 30 2002 |

### Publication series

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

Volume | 2420 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 |
---|---|

Country | Poland |

City | Warsaw |

Period | 8/26/02 → 8/30/02 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -