String inference from longest-common-prefix array
From MaRDI portal
Publication:2110373
DOI10.1016/J.TCS.2022.11.032OpenAlexW4310497564MaRDI QIDQ2110373
Juha Kärkkäinen, Marcin Piątkowski, Simon J. Puglisi
Publication date: 21 December 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.032
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Burrows-Wheeler transformations and de Bruijn words
- Replacing suffix trees with enhanced suffix arrays
- Counting suffix arrays and strings
- Computing longest previous factor in linear time and applications
- Counting permutations with given cycle structure and descent set
- Validating the Knuth-Morris-Pratt failure function, fast and online
- A suffix tree or not a suffix tree?
- On the combinatorics of suffix arrays
- An extension of the Burrows-Wheeler transform
- Inferring Strings from Lyndon Factorization
- Tighter Bounds for the Sum of Irreducible LCP Values
- Suffix Arrays: A New Method for On-Line String Searches
- Cover Array String Reconstruction
- Efficient validation and construction of border arrays and validation of string matching automata
- Algorithms on Strings, Trees and Sequences
- Reversing Longest Previous Factor Tables is Hard
- REVERSE ENGINEERING PREFIX TABLES
- Mathematical Foundations of Computer Science 2003
This page was built for publication: String inference from longest-common-prefix array
