Counting suffix arrays and strings
type: Item
instance of: scholarly article
title: Counting suffix arrays and strings
zbMATH Open document ID: 1142.68026
author: Klaus-Bernd Schürmann
author: Jens Stoye
published in: Theoretical Computer Science
publication date: 2008-07-10T00:00:00Z
full work available at URL: https://pub.uni-bielefeld.de/record/1970472
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5299457
zbMATH Keywords: strings
zbMATH Keywords: suffix arrays
zbMATH Keywords: permutations
MaRDI profile type: Publication
OpenAlex ID: W2004566805
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Q4449231
cites work: Q4547749
cites work: Constructing suffix arrays in linear time
cites work: Space efficient linear time construction of suffix arrays
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Q4472515
cites work: Q4432981
cites work: A linear lower bound on index size for text retrieval
cites work: Lower bounds on the size of selection and rank indexes
cites work: Compressed representations of sequences and full-text indexes
cites work: Words over an ordered alphabet and suffix permutations
cites work: A note on the Burrows-Wheeler transformation
cites work: Lyndon words, permutations and trees.
cites work: Fast Lightweight Suffix Array Construction and Checking
cites work: Mathematical Foundations of Computer Science 2003
cites work: String processing and information retrieval. 12th international conference, SPIRE 2005, Buenos Aires, Argentina, November 2--4, 2005. Proceedings
cites work: Q4320535
cites work: Counting distinct strings
DOI: 10.1016/J.TCS.2008.01.011
description: scientific article; zbMATH DE number 5299457