On suffix tree detection
From MaRDI portal
Publication:6545407
DOI10.1007/978-3-031-43980-3_2MaRDI QIDQ6545407FDOQ6545407
Authors: Amihood Amir, Eitan Kondratovsky, Avivit Levy 
Publication date: 29 May 2024
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- A Space-Economical Suffix Tree Construction Algorithm
- On-line construction of suffix trees
- Reverse engineering prefix tables
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Inferring strings from suffix trees and links on a binary alphabet
- On the combinatorics of suffix arrays
- Cover array string reconstruction
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
- Counting suffix arrays and strings
- A categorization theorem on suffix arrays with applications to space efficient text indexes
- Efficient validation and construction of border arrays and validation of string matching automata
- Universal reconstruction of a string
- Verifying and enumerating parameterized border arrays
- On suffix extensions in suffix trees
- Cycle detection and correction
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Inferring strings from Lyndon factorization
- Can we recover the cover?
- String inference from longest-common-prefix array
- Recognizing union-find trees is NP-complete, even without rank info
Cited In (1)
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)
