Inverse Lyndon words and inverse Lyndon factorizations of words
From MaRDI portal
Publication:1795498
DOI10.1016/j.aam.2018.08.005zbMath1402.68143arXiv1705.10277OpenAlexW3103389278WikidataQ114214526 ScholiaQ114214526MaRDI QIDQ1795498
Rocco Zaccagnino, Rosalba Zizza, Paola Bonizzoni, Clelia De Felice
Publication date: 16 October 2018
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.10277
Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)
Related Items (11)
New results on Nyldon words and Nyldon-like sets ⋮ Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ On generalized Lyndon words ⋮ Reprint of: ``Generalized Lyndon factorizations of infinite words ⋮ String Attractors of Fixed Points of k-Bonacci-Like Morphisms ⋮ Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ Generalized Lyndon factorizations of infinite words ⋮ Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning ⋮ Nyldon words
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Suffix array and Lyndon factorization of a text
- A bijection between words and multisets of necklaces
- Numeration and enumeration
- The origins of combinatorics on words
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Counting permutations with given cycle structure and descent set
- Parallel RAM algorithms for factorizing words
- Lyndon words, permutations and trees.
- A note on the Burrows-Wheeler transformation
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- An extension of the Burrows-Wheeler transform
- Generalized Lyndon words
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Fast parallel Lyndon factorization with applications
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Suffixes, Conjugates and Lyndon Words
- A new characterization of maximal repetitions by Lyndon trees
- Algorithms on Strings
- On a Factorisation of Free Monoids
- Lyndon Words and Short Superstrings
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Inverse Lyndon words and inverse Lyndon factorizations of words
