Extended suffix array construction using Lyndon factors

DOI10.1007/S12046-018-0832-ZMaRDI QIDQ1615410zbMATH OpenOpenAlexFDO

Authors 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

data structurelongest common prefixLyndon factorssuffix array

Mathematics Subject Classification ID

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

Recommendations

• Suffix array and Lyndon factorization of a text
• Linear-time construction of suffix arrays (extended abstract)
• An elegant algorithm for the construction of suffix arrays
• Linear work suffix array construction
• Dynamic extended suffix arrays
• Constructing suffix arrays in linear time
• RECONSTRUCTING A SUFFIX ARRAY
• Lightweight parameterized suffix array construction
• Scalable Parallel Suffix Array Construction

Cites work

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

Cited in

(4)

• Lyndon array construction during Burrows-Wheeler inversion
• Suffix array and Lyndon factorization of a text
• Inducing the Lyndon array
• Dynamic extended suffix arrays

Describes a project that uses

Uses Software

• KABOOM
• essaMEM
• Readjoiner
• SHREC

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1615410)