Inferring strings from suffix trees and links on a binary alphabet
From MaRDI portal
(Redirected from Publication:496548)
Recommendations
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Border array on bounded alphabet
- Counting distinct strings
- Counting Parameterized Border Arrays for a Binary Alphabet
- Counting suffix arrays and strings
- Cover array string reconstruction
- Efficient validation and construction of border arrays and validation of string matching automata
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 177570 (Why is no real title available?)
- scientific article; zbMATH DE number 1874382 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- On-line construction of suffix trees
- Reverse engineering prefix tables
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Verifying a parameterized border array in \(O(n ^{1.5})\) time
- Words over an ordered alphabet and suffix permutations
Cited in
(15)- Recognizing union-find trees is NP-complete
- String inference from longest-common-prefix array
- When a dollar makes a BWT
- Universal reconstruction of a string
- On the size of the smallest alphabet for Lyndon trees
- Inferring strings from Lyndon factorization
- From Suffix Trees to Suffix Vectors
- Universal reconstruction of a string
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Recognizing union-find trees is NP-complete, even without rank info
- Inferring strings from position heaps in linear time
- Verifying and enumerating parameterized border arrays
- On suffix tree detection
- On suffix tree detection
- Inverting parameterized Burrows-Wheeler transform
This page was built for publication: Inferring strings from suffix trees and links on a binary alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496548)
