\(V\)-words, Lyndon words and substring circ-UMFFs
From MaRDI portal
Publication:6606210
DOI10.1007/978-3-031-49611-0_34MaRDI QIDQ6606210
Neerja Mhaskar, Jacqueline W. Daykin, W. F. Smyth
Publication date: 16 September 2024
combinatoricsfactorizationtotal order\(V\)-ordercirc-UMFF\(V\)-WordLyndon Wordsubstring circ-UMFFUMFF
Cites Work
- Title not available (Why is that?)
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
- A bijection between words and multisets of necklaces
- Binary block order Rouen transform
- Lyndon-like and V-order factorizations of strings
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
- The alternating BWT: an algorithmic perspective
- Indeterminate string factorizations and degenerate text transformations
- Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
- On generalized Lyndon words
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- Generalized Lyndon words
- Simple linear comparison of strings in \(V\)-order
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time
- Factorizing words over an ordered alphabet
- Combinatorics of Unique Maximal Factorization Families (UMFFs)
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
- Algorithms on Strings
- Simple Linear Comparison of Strings in V-Order
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: \(V\)-words, Lyndon words and substring circ-UMFFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606210)
