Suffix array and Lyndon factorization of a text
From MaRDI portal
Publication:405567
DOI10.1016/J.JDA.2014.06.001zbMATH Open1306.68127OpenAlexW2007399809MaRDI QIDQ405567FDOQ405567
Authors: Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, M. Sciortino 
Publication date: 5 September 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.06.001
Recommendations
Cites Work
- Factorizing words over an ordered alphabet
- Optimal Dynamic Sequence Representations
- Title not available (Why is that?)
- Free differential calculus. IV: The quotient groups of the lower central series
- Parallel RAM algorithms for factorizing words
- An extension of the Burrows-Wheeler transform
- Title not available (Why is that?)
- Lightweight algorithms for constructing and inverting the BWT of string collections
- A space and time efficient algorithm for constructing compressed suffix arrays
- Lyndon words, permutations and trees.
- Lightweight data indexing and compression in external memory
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- Fast parallel Lyndon factorization with applications
- Scalable Parallel Suffix Array Construction
- Words over an ordered alphabet and suffix permutations
- A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
- Suffixes, conjugates and Lyndon words
- A quick tour on suffix arrays and compressed suffix arrays
- Title not available (Why is that?)
Cited In (17)
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Extended suffix array construction using Lyndon factors
- Lyndon array construction during Burrows-Wheeler inversion
- Inferring Strings from Lyndon Factorization
- Suffixes, conjugates and Lyndon words
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- A survey of string orderings and their application to the Burrows-Wheeler transform
- A combinatorial view on string attractors
- Cartesian and Lyndon trees
- Enhanced string factoring from alphabet orderings
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Lyndon factorization algorithms for small alphabets and run-length encoded strings
This page was built for publication: Suffix array and Lyndon factorization of a text
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405567)
