A linear time lower bound on McCreight and general updating algorithms for suffix trees
type: Item
instance of: scholarly article
title: A linear time lower bound on McCreight and general updating algorithms for suffix trees
zbMATH Open document ID: 1069.68548
author: Mauricio Ayala-Rincón
author: Paulo D. Conejo
published in: Algorithmica
publication date: 2004-09-22T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2102129
zbMATH Keywords: Linear-time algorithm
zbMATH Keywords: Suffix tree
zbMATH Keywords: Suffix trie
MaRDI profile type: Publication
Wikidata QID: Q58001539
full work available at URL: s00453-003-1034-5
OpenAlex ID: W2041306856
cites work: Q3690245
cites work: Optimal off-line detection of repetitions in a string
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Q4886088
cites work: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
cites work: Matching a set of strings with variable length don't cares
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: On-line construction of suffix trees
DOI: 10.1007/S00453-003-1034-5
DBLP publication ID: journals/algorithmica/Ayala-RinconC03
description: scientific article; zbMATH DE number 2102129