Pages that link to "Item:Q405568"
From MaRDI portal
The following pages link to Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568):
Displayed 8 items.
- 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)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Inferring strings from position heaps in linear time (Q6091154) (← links)