Cover Array String Reconstruction
From MaRDI portal
Publication:3575252
DOI10.1007/978-3-642-13509-5_23zbMath1286.68524OpenAlexW1834231399MaRDI QIDQ3575252
Solon P. Pissis, German Tischler, Maxime Crochemore, Costas S. Iliopoulos
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
Related Items
Universal Reconstruction of a String, Validating the Knuth-Morris-Pratt failure function, fast and online, Can we recover the cover?, Recognizing union-find trees is NP-complete, Indeterminate string inference algorithms, String Covering: A Survey, The set of parameterized \(k\)-covers problem, Reconstructing a string from its Lyndon arrays, Verifying and enumerating parameterized border arrays, Experimental evaluation of algorithms for computing quasiperiods, Inferring strings from suffix trees and links on a binary alphabet, Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info, Universal reconstruction of a string, Approximate cover of strings, A suffix tree or not a suffix tree?, String inference from longest-common-prefix array, Quasi-Periodicity Under Mismatch Errors
