Pages that link to "Item:Q1698704"
From MaRDI portal
The following pages link to Reconstructing a string from its Lyndon arrays (Q1698704):
Displaying 7 items.
- Enhanced string factoring from alphabet orderings (Q1711413) (← links)
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order (Q2043023) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms (Q6559402) (← links)
