### 抄録

We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed in O(n log n) expected time and space to answer reachability queries in O(log n) time. Furthermore, we present a series of strings that require $Θ(n)$ time and space to answer reachability queries in O(log n) time for the same algorithm. Exhaustive computational calculations for strings of length n ≤ 33 have revealed that the same strings are also the worst case instances of the algorithm. We therefore conjecture that reachability queries can be answered in O(log n) time with a worst case time and space preprocessing complexity of $Θ {n}$.

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

ページ（範囲） | 147-162 |

ページ数 | 16 |

ジャーナル | International Journal of Foundations of Computer Science |

巻 | 19 |

発行部数 | 1 |

DOI | |

出版物ステータス | 出版済み - 2 1 2008 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science (miscellaneous)

### これを引用

**Reachability on suffix tree graphs.** / Higa, Yasuto; Bannai, Hideo; Inenaga, Shunsuke; Takeda, Masayuki.

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

*International Journal of Foundations of Computer Science*, 巻. 19, 番号 1, pp. 147-162. https://doi.org/10.1142/S0129054108005590

}

TY - JOUR

T1 - Reachability on suffix tree graphs

AU - Higa, Yasuto

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

PY - 2008/2/1

Y1 - 2008/2/1

N2 - We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed in O(n log n) expected time and space to answer reachability queries in O(log n) time. Furthermore, we present a series of strings that require $Θ(n)$ time and space to answer reachability queries in O(log n) time for the same algorithm. Exhaustive computational calculations for strings of length n ≤ 33 have revealed that the same strings are also the worst case instances of the algorithm. We therefore conjecture that reachability queries can be answered in O(log n) time with a worst case time and space preprocessing complexity of $Θ {n}$.

AB - We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed in O(n log n) expected time and space to answer reachability queries in O(log n) time. Furthermore, we present a series of strings that require $Θ(n)$ time and space to answer reachability queries in O(log n) time for the same algorithm. Exhaustive computational calculations for strings of length n ≤ 33 have revealed that the same strings are also the worst case instances of the algorithm. We therefore conjecture that reachability queries can be answered in O(log n) time with a worst case time and space preprocessing complexity of $Θ {n}$.

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

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

U2 - 10.1142/S0129054108005590

DO - 10.1142/S0129054108005590

M3 - Article

VL - 19

SP - 147

EP - 162

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 1

ER -