Computing suffix links for suffix trees and arrays
type: Item
instance of: scholarly article
title: Computing suffix links for suffix trees and arrays
zbMATH Open document ID: 1184.68607
author: Moritz G. Maaß
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5664767
zbMATH Keywords: algorithms
zbMATH Keywords: pattern matching
zbMATH Keywords: suffix links
zbMATH Keywords: suffix trees
zbMATH Keywords: suffix arrays
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.12.012
OpenAlex ID: W2160738675
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: On-line construction of suffix trees
cites work: Algorithms on Strings, Trees and Sequences
cites work: Sublinear approximate string matching and biological applications
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Q4449231
cites work: Linear-Time Construction of Suffix Arrays
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: Q4547749
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Q4508365
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Q4828936
cites work: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
DOI: 10.1016/J.IPL.2005.12.012
description: scientific article; zbMATH DE number 5664767