On suffix tree detection
From MaRDI portal
Publication:6545407
DOI10.1007/978-3-031-43980-3_2MaRDI QIDQ6545407
Amihood Amir, A. Levy, Eitan Kondratovsky
Publication date: 29 May 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Inferring strings from suffix trees and links on a binary alphabet
- Verifying and enumerating parameterized border arrays
- On suffix extensions in suffix trees
- Counting suffix arrays and strings
- Validating the Knuth-Morris-Pratt failure function, fast and online
- On-line construction of suffix trees
- Universal reconstruction of a string
- A suffix tree or not a suffix tree?
- Inferring strings from Lyndon factorization
- Can we recover the cover?
- On the combinatorics of suffix arrays
- Cycle detection and correction
- Cover Array String Reconstruction
- Efficient validation and construction of border arrays and validation of string matching automata
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- String Inference from Longest-Common-Prefix Array
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info
- REVERSE ENGINEERING PREFIX TABLES
- Mathematical Foundations of Computer Science 2003
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)
