Pages that link to "Item:Q4800257"
From MaRDI portal
The following pages link to Words over an ordered alphabet and suffix permutations (Q4800257):
Displaying 15 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6199197) (← links)
