Pages that link to "Item:Q2402270"
From MaRDI portal
The following pages link to Inferring strings from Lyndon factorization (Q2402270):
Displaying 11 items.
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Inferring strings from cover arrays (Q2846478) (← links)
- Inferring Strings from Lyndon Factorization (Q2922642) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6199197) (← links)
- On suffix tree detection (Q6545407) (← links)
- On suffix tree detection (Q6593670) (← links)