On suffix tree detection
From MaRDI portal
Publication:6545407
Recommendations
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1874382 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A categorization theorem on suffix arrays with applications to space efficient text indexes
- Algorithms on Strings, Trees and Sequences
- Can we recover the cover?
- Counting suffix arrays and strings
- Cover array string reconstruction
- Cycle detection and correction
- Efficient validation and construction of border arrays and validation of string matching automata
- Inferring strings from Lyndon factorization
- Inferring strings from suffix trees and links on a binary alphabet
- Mathematical Foundations of Computer Science 2003
- On suffix extensions in suffix trees
- On the combinatorics of suffix arrays
- On-line construction of suffix trees
- Recognizing union-find trees is NP-complete, even without rank info
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Reverse engineering prefix tables
- String inference from longest-common-prefix array
- Universal reconstruction of a string
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Verifying and enumerating parameterized border arrays
This page was built for publication: On suffix tree detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545407)