Extended suffix array construction using Lyndon factors
type: Item
instance of: scholarly article
title: Extended suffix array construction using Lyndon factors
zbMATH Open document ID: 1398.68112
author: Sunita
author: Deepak Garg
published in: Sādhanā
publication date: 2018-10-31T00:00:00Z
full work available at URL: https://www.ias.ac.in/describe/article/sadh/043/08/0133
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6969177
zbMATH Keywords: data structure
zbMATH Keywords: suffix array
zbMATH Keywords: Lyndon factors
zbMATH Keywords: longest common prefix
describes a project that uses: KABOOM
describes a project that uses: essaMEM
describes a project that uses: Readjoiner
describes a project that uses: SHREC
MaRDI profile type: Publication
OpenAlex ID: W2820768319
cites work: Indexing compressed text
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: A space and time efficient algorithm for constructing compressed suffix arrays
cites work: Q5705142
cites work: An(other) Entropy-Bounded Compressed Suffix Tree
cites work: Compressed suffix trees with full functionality
cites work: Engineering a compressed suffix tree implementation
cites work: Algorithms on Strings, Trees and Sequences
cites work: The string B-tree
cites work: Free differential calculus. IV: The quotient groups of the lower central series
cites work: Factorizing words over an ordered alphabet
cites work: Lyndon + Christoffel = digitally convex
cites work: Lyndon words, permutations and trees.
cites work: Combinatorics on Words
cites work: Suffixes, Conjugates and Lyndon Words
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Q4472515
cites work: Suffix array and Lyndon factorization of a text
cites work: Fast parallel Lyndon factorization with applications
cites work: Lightweight data indexing and compression in external memory
cites work: Dynamic Entropy-Compressed Sequences and Full-Text Indexes
cites work: Improved Dynamic Rank-Select Entropy-Bound Structures
cites work: Linear work suffix array construction
cites work: Q4508365
cites work: Permuted Longest-Common-Prefix Array
cites work: Q4547749
DOI: 10.1007/S12046-018-0832-Z
Recommended article: Suffix array and Lyndon factorization of a text
Recommended article: Linear-Time Construction of Suffix Arrays
Recommended article: An elegant algorithm for the construction of suffix arrays
Recommended article: Linear work suffix array construction
Recommended article: Dynamic extended suffix arrays
Recommended article: Constructing suffix arrays in linear time
Recommended article: RECONSTRUCTING A SUFFIX ARRAY
Recommended article: Lightweight Parameterized Suffix Array Construction
Recommended article: Scalable Parallel Suffix Array Construction
description: scientific article; zbMATH DE number 6969177