O(n) time reconstruction of parameterized strings from parameterized suffix and LCP arrays
From MaRDI portal
Publication:7446587
Cites work
- A suffix tree or not a suffix tree?
- Border array on bounded alphabet
- Cover array string reconstruction
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- Efficient parameterized pattern matching in sublinear space
- Efficient validation and construction of border arrays and validation of string matching automata
- Fast Algorithms for Finding Nearest Common Ancestors
- scientific article; zbMATH DE number 6678937 (Why is no real title available?)
- scientific article; zbMATH DE number 1306895 (Why is no real title available?)
- scientific article; zbMATH DE number 1874382 (Why is no real title available?)
- Inferring an indeterminate string from a prefix graph
- Inferring strings from cover arrays
- Inferring strings from full abelian periods
- Inferring strings from Lyndon factorization
- Inferring strings from position heaps in linear time
- Inferring strings from suffix trees and links on a binary alphabet
- Introduction to algorithms
- Mathematical Foundations of Computer Science 2003
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- On suffix tree detection
- On the longest common parameterized subsequence
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Parameterized pattern matching: Algorithms and applications
- RECONSTRUCTING A SUFFIX ARRAY
- Reconstructing parameterized strings from parameterized suffix and LCP arrays
- Recovering, counting and enumerating strings from forward and backward suffix arrays
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Reverse engineering prefix tables
- Reversing longest previous factor tables is hard
- String inference from longest-common-prefix array
- Towards a real time algorithm for parameterized longest common prefix computation
- Universal reconstruction of a string
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Variations of the parameterized longest previous factor
- Verifying and enumerating parameterized border arrays
- Words over an ordered alphabet and suffix permutations
This page was built for publication: \(\tilde{O}(n)\) time reconstruction of parameterized strings from parameterized suffix and LCP arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446587)