Pages that link to "Item:Q2445335"
From MaRDI portal
The following pages link to On the combinatorics of suffix arrays (Q2445335):
Displaying 10 items.
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- \(r\)-indexing the eBWT (Q6543261) (← links)
- On suffix tree detection (Q6545407) (← links)
- On suffix tree detection (Q6593670) (← links)
