Pages that link to "Item:Q496548"
From MaRDI portal
The following pages link to Inferring strings from suffix trees and links on a binary alphabet (Q496548):
Displaying 9 items.
- Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- 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)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
