Cover array string reconstruction
From MaRDI portal
Publication:3575252
DOI10.1007/978-3-642-13509-5_23zbMATH Open1286.68524OpenAlexW1834231399MaRDI QIDQ3575252FDOQ3575252
Authors: Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler 
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00742038/file/Cover_array_string_reconstruction.pdf
Recommendations
Cited In (23)
- Universal reconstruction of a string
- Universal reconstruction of a string
- Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)
- String Covering: A Survey
- String inference from longest-common-prefix array
- Quasi-periodicity under mismatch errors
- Inferring strings from suffix trees and links on a binary alphabet
- The set of parameterized \(k\)-covers problem
- Recognizing union-find trees is NP-complete, even without rank info
- Approximate cover of strings
- Can we recover the cover?
- Verifying an enhanced cover array in linear time
- On suffix tree detection
- Indeterminate string inference algorithms
- Experimental evaluation of algorithms for computing quasiperiods
- Computing the cover array in linear time
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Recognizing union-find trees is NP-complete
- Verifying and enumerating parameterized border arrays
- Reconstructing a string from its Lyndon arrays
- Inferring strings from cover arrays
- On suffix tree detection
- Efficient Reconstruction of RC-Equivalent Strings
This page was built for publication: Cover array string reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575252)
