Near real-time suffix tree construction via the fringe marked ancestor problem
From MaRDI portal
Publication:2376800
DOI10.1016/j.jda.2012.07.003zbMath1267.68323WikidataQ61609398 ScholiaQ61609398MaRDI QIDQ2376800
Giuseppe F. Italiano, Dany Breslauer
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.07.003
Related Items
Online algorithms for constructing linear-size suffix trie, Searching Long Repeats in Streams, The Online House Numbering Problem: Min-Max Online List Labeling, Linear-size suffix tries, On suffix extensions in suffix trees, Fully-online suffix tree and directed acyclic word graph construction for multiple texts, Suffix trays and suffix trists: structures for faster text indexing, Full-fledged real-time indexing for constant size alphabets, Alphabet-Dependent String Searching with Wexponential Search Trees, Online Detection of Repetitions with Backtracking, The longest common substring problem