Universal Reconstruction of a String
From MaRDI portal
Publication:3449836
DOI10.1007/978-3-319-21840-3_32zbMath1435.68397OpenAlexW2398642674MaRDI QIDQ3449836
Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_32
Related Items (3)
Lower bounds for the number of repetitions in 2D strings ⋮ Tight bound for the number of distinct palindromes in a tree ⋮ Universal reconstruction of a string
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Indeterminate strings, prefix arrays \& undirected graphs
- Inferring strings from suffix trees and links on a binary alphabet
- Verifying and enumerating parameterized border arrays
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Inferring an indeterminate string from a prefix graph
- A suffix tree or not a suffix tree?
- Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet
- Inferring Strings from Lyndon Factorization
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
- Linear work suffix array construction
- Cover Array String Reconstruction
- Efficient validation and construction of border arrays and validation of string matching automata
- Jewels of Stringology
- Searching of Gapped Repeats and Subrepetitions in a Word
- Reversing Longest Previous Factor Tables is Hard
- The “Runs” Theorem
- Internal Pattern Matching Queries in a Text and Applications
- REVERSE ENGINEERING PREFIX TABLES
- Mathematical Foundations of Computer Science 2003
- Algorithms on Strings
This page was built for publication: Universal Reconstruction of a String
