Pages that link to "Item:Q3526553"
From MaRDI portal
The following pages link to PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS (Q3526553):
Displaying 12 items.
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- Enhanced string factoring from alphabet orderings (Q1711413) (← links)
- Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
- String factorisations with maximum or minimum dimension (Q2006777) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- Combinatorics of Unique Maximal Factorization Families (UMFFs) (Q3400579) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Maximal unbordered factors of random strings (Q5916287) (← links)
- \(V\)-words, Lyndon words and substring circ-UMFFs (Q6606210) (← links)
