Suffix array and Lyndon factorization of a text
type: Item
instance of: scholarly article
title: Suffix array and Lyndon factorization of a text
zbMATH Open document ID: 1306.68127
author: Sabrina Mantaci
author: Antonio Restivo
author: Giovanna Rosone
author: M. Sciortino
published in: Journal of Discrete Algorithms
publication date: 2014-09-05T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6340536
zbMATH Keywords: sorting suffixes
zbMATH Keywords: BWT
zbMATH Keywords: suffix array
zbMATH Keywords: Lyndon word
zbMATH Keywords: Lyndon factorization
MaRDI profile type: Publication
full work available at URL: j.jda.2014.06.001
OpenAlex ID: W2007399809
cites work: Fast parallel Lyndon factorization with applications
cites work: Lightweight algorithms for constructing and inverting the BWT of string collections
cites work: Suffixes, Conjugates and Lyndon Words
cites work: Free differential calculus. IV: The quotient groups of the lower central series
cites work: A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
cites work: Parallel RAM algorithms for factorizing words
cites work: Factorizing words over an ordered alphabet
cites work: Words over an ordered alphabet and suffix permutations
cites work: Lightweight data indexing and compression in external memory
cites work: From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
cites work: A quick tour on suffix arrays and compressed suffix arrays
cites work: Lyndon words, permutations and trees.
cites work: A space and time efficient algorithm for constructing compressed suffix arrays
cites work: Scalable Parallel Suffix Array Construction
cites work: Q4681771
cites work: Q3138909
cites work: An extension of the Burrows-Wheeler transform
cites work: Optimal Dynamic Sequence Representations
cites work: Q5506326
DOI: 10.1016/J.JDA.2014.06.001
description: scientific article; zbMATH DE number 6340536