On-Line Linear-Time Construction of Word Suffix Trees

DOI10.1007/11780441_7zbMath1196.68062OpenAlexW1502292638MaRDI QIDQ5307493

Masayuki Takeda, Shunsuke Inenaga

Publication date: 14 September 2007

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780441_7

Mathematics Subject Classification ID

Data structures (68P05) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (3)

Sparse and Truncated Suffix Trees on Variable-Length Codes ⋮ On-line construction of compact suffix vectors and maximal repeats ⋮ Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

This page was built for publication: On-Line Linear-Time Construction of Word Suffix Trees