Reachability on suffix tree graphs

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

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

Abstract

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√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√n).

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference '06
Pages212-225
Number of pages14
Publication statusPublished - Dec 1 2006
EventPrague Stringology Conference '06, PSC 2006 - Prague, Czech Republic
Duration: Aug 28 2006Aug 30 2006

Publication series

NameProceedings of the Prague Stringology Conference '06

Other

OtherPrague Stringology Conference '06, PSC 2006
CountryCzech Republic
CityPrague
Period8/28/068/30/06

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Reachability on suffix tree graphs'. Together they form a unique fingerprint.

Cite this