On-line construction of parameterized suffix trees for large alphabets
type: Item
instance of: scholarly article
title: On-line construction of parameterized suffix trees for large alphabets
zbMATH Open document ID: 1260.68459
author: Taehyung Lee
author: Joong Chae Na
author: Kunsoo Park
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6150254
zbMATH Keywords: data structures
zbMATH Keywords: design of algorithms
zbMATH Keywords: randomized algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.11.017
OpenAlex ID: W1992275936
cites work: A theory of parameterized pattern matching
cites work: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
cites work: Generalization of a suffix tree for RNA structural pattern matching
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: On-line construction of suffix trees
cites work: On the sorting-complexity of suffix tree construction
cites work: Q4252748
cites work: Faster Suffix Tree Construction with Missing Suffix Links
cites work: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
cites work: Improving on-line construction of two-dimensional suffix trees for square matrices
cites work: Linear-time construction of two-dimensional suffix trees
DOI: 10.1016/J.IPL.2010.11.017
description: scientific article; zbMATH DE number 6150254