### 抄録

Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these structures are suffix trees and directed acyclic word graphs (DAWGs), which can be efficiently constructed in linear time and space. Compact directed acyclic word graphs (CDAWGs) are an index structure preserving some features of both suffix trees and DAWGs, and require less space than both of them. An algorithm which directly constructs CDAWGs in linear time and space was first introduced by Crochemore and Vérin, based on McCreight's algorithm for constructing suffix trees. In this work, we present a novel on-line linear-time algorithm that builds the CDAWG for a single string as well as for a set of strings, inspired by Ukkonen's on-line algorithm for constructing suffix trees.

元の言語 | 英語 |
---|---|

ページ（範囲） | 156-179 |

ページ数 | 24 |

ジャーナル | Discrete Applied Mathematics |

巻 | 146 |

発行部数 | 2 |

DOI | |

出版物ステータス | 出版済み - 3 1 2005 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics
- Applied Mathematics

### これを引用

*Discrete Applied Mathematics*,

*146*(2), 156-179. https://doi.org/10.1016/j.dam.2004.04.012

**On-line construction of compact directed acyclic word graphs.** / Inenaga, Shunsuke; Hoshino, Hiromasa; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo; Mauri, Giancarlo; Pavesi, Giulio.

研究成果: ジャーナルへの寄稿 › 記事

*Discrete Applied Mathematics*, 巻. 146, 番号 2, pp. 156-179. https://doi.org/10.1016/j.dam.2004.04.012

}

TY - JOUR

T1 - On-line construction of compact directed acyclic word graphs

AU - Inenaga, Shunsuke

AU - Hoshino, Hiromasa

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

AU - Arikawa, Setsuo

AU - Mauri, Giancarlo

AU - Pavesi, Giulio

PY - 2005/3/1

Y1 - 2005/3/1

N2 - Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these structures are suffix trees and directed acyclic word graphs (DAWGs), which can be efficiently constructed in linear time and space. Compact directed acyclic word graphs (CDAWGs) are an index structure preserving some features of both suffix trees and DAWGs, and require less space than both of them. An algorithm which directly constructs CDAWGs in linear time and space was first introduced by Crochemore and Vérin, based on McCreight's algorithm for constructing suffix trees. In this work, we present a novel on-line linear-time algorithm that builds the CDAWG for a single string as well as for a set of strings, inspired by Ukkonen's on-line algorithm for constructing suffix trees.

AB - Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these structures are suffix trees and directed acyclic word graphs (DAWGs), which can be efficiently constructed in linear time and space. Compact directed acyclic word graphs (CDAWGs) are an index structure preserving some features of both suffix trees and DAWGs, and require less space than both of them. An algorithm which directly constructs CDAWGs in linear time and space was first introduced by Crochemore and Vérin, based on McCreight's algorithm for constructing suffix trees. In this work, we present a novel on-line linear-time algorithm that builds the CDAWG for a single string as well as for a set of strings, inspired by Ukkonen's on-line algorithm for constructing suffix trees.

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

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

U2 - 10.1016/j.dam.2004.04.012

DO - 10.1016/j.dam.2004.04.012

M3 - Article

VL - 146

SP - 156

EP - 179

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -