Cover array string reconstruction

DOI10.1007/978-3-642-13509-5_23MaRDI QIDQ3575252zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Verifying an enhanced cover array in linear time
• Inferring strings from cover arrays
• Computing the cover array in linear time
• An optimal algorithm to compute all the covers of a string
• Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)

Cited in

(23)

• Efficient Reconstruction of RC-Equivalent Strings
• 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 inference from longest-common-prefix array
• Inferring strings from suffix trees and links on a binary alphabet
• String Covering: A Survey
• Quasi-periodicity under mismatch errors
• 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

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)