Pages that link to "Item:Q507399"
From MaRDI portal
The following pages link to Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399):
Displaying 9 items.
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
