On-line suffix tree construction with reduced branching

DOI10.1016/J.JDA.2012.01.001zbMath1242.68085OpenAlexW2076050261MaRDI QIDQ414471

Martin Senft, Tomáš Dvořák

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.01.001

zbMATH Keywords

branchingsliding windowsuffix treeconstruction algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Unnamed Item
• Compact directed acyclic word graphs for a sliding window
• Dynamic extended suffix arrays
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Database indexing for large DNA and protein sequence collections
• Engineering a lightweight suffix array construction algorithm
• On-line construction of suffix trees
• Self-alignments in words and their applications
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences

This page was built for publication: On-line suffix tree construction with reduced branching