REACHABILITY ON SUFFIX TREE GRAPHS

DOI10.1142/S0129054108005590zbMATH Open1169.68376OpenAlexW2040651649MaRDI QIDQ3532147FDOQ3532147

Masayuki Takeda, Shunsuke Inenaga, Yasuto Higa, Hideo Bannai

Publication date: 3 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108005590

Recommendations

• Fully-Compressed Suffix Trees
• On the time-space complexity of reachability queries for preprocessed graphs
• On-line construction of suffix trees
• Representing the suffix tree with the CDAWG
• An estimation of the size of non-compact suffix trees

zbMATH Keywords

data structuresgraph reachability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computing methodologies for text processing; mathematical typography (68U15)

Cites Work

• Algorithms on Strings, Trees and Sequences
• A Space-Economical Suffix Tree Construction Algorithm
• On-line construction of suffix trees
• Self-alignments in words and their applications
• On the vector representation of the reachability in planar directed graphs
• A data structure for lattice representation

This page was built for publication: REACHABILITY ON SUFFIX TREE GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532147)