Pages that link to "Item:Q2343297"
From MaRDI portal
The following pages link to A suffix tree or not a suffix tree? (Q2343297):
Displayed 10 items.
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Item:Q2343297 (redirect page) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- Inferring strings from position heaps in linear time (Q6091154) (← links)