Pages that link to "Item:Q2514148"
From MaRDI portal
The following pages link to Detecting regularities on grammar-compressed strings (Q2514148):
Displaying 7 items.
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)
