Pages that link to "Item:Q1426043"
From MaRDI portal
The following pages link to Lyndon words, permutations and trees. (Q1426043):
Displaying 18 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- Words over an ordered alphabet and suffix permutations (Q4800257) (← links)
- (Q5088889) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- (Q6065473) (← links)
- Inducing the Lyndon array (Q6536249) (← links)
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms (Q6559402) (← links)
