On-line construction of compact suffix vectors and maximal repeats
type: Item
instance of: scholarly article
title: On-line construction of compact suffix vectors and maximal repeats
zbMATH Open document ID: 1154.68044
author: Élise Prieur
author: Thierry Lecroq
published in: Theoretical Computer Science
publication date: 2008-11-18T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5368336
zbMATH Keywords: suffix vectors
zbMATH Keywords: suffix trees
zbMATH Keywords: compact suffix automata
zbMATH Keywords: design of analysis
zbMATH Keywords: maximal repeats
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.06.017
OpenAlex ID: W2164921635
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Q3690245
cites work: Algorithms and Computation
cites work: Distributed and Paged Suffix Trees for Large Genetic Databases
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q4418628
cites work: On-Line Linear-Time Construction of Word Suffix Trees
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Q4474136
cites work: Space efficient suffix trees
cites work: From Suffix Trees to Suffix Vectors
cites work: On maximal repeats in strings
cites work: On-line construction of suffix trees
DOI: 10.1016/J.TCS.2008.06.017
description: scientific article; zbMATH DE number 5368336