Extended suffix array construction using Lyndon factors

DOI10.1007/s12046-018-0832-zzbMath1398.68112OpenAlexW2820768319MaRDI QIDQ1615410

Sunita, Deepak Garg

Publication date: 31 October 2018

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://www.ias.ac.in/describe/article/sadh/043/08/0133

zbMATH Keywords

suffix arraylongest common prefixdata structureLyndon factors

Mathematics Subject Classification ID

Combinatorics on words (68R15) Data structures (68P05) Algorithms on strings (68W32)

Uses Software

• KABOOM
• SHREC
• Readjoiner
• essaMEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Suffix array and Lyndon factorization of a text
• Lyndon + Christoffel = digitally convex
• A space and time efficient algorithm for constructing compressed suffix arrays
• Lyndon words, permutations and trees.
• Lightweight data indexing and compression in external memory
• Compressed suffix trees with full functionality
• Suffix Arrays: A New Method for On-Line String Searches
• The string B-tree
• Factorizing words over an ordered alphabet
• Linear work suffix array construction
• An(other) Entropy-Bounded Compressed Suffix Tree
• Indexing compressed text
• Combinatorics on Words
• Permuted Longest-Common-Prefix Array
• Algorithms on Strings, Trees and Sequences
• Fast parallel Lyndon factorization with applications
• Suffixes, Conjugates and Lyndon Words
• Dynamic Entropy-Compressed Sequences and Full-Text Indexes
• Engineering a compressed suffix tree implementation
• Improved Dynamic Rank-Select Entropy-Bound Structures
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: Extended suffix array construction using Lyndon factors