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

(24)

• Validating the Knuth-Morris-Pratt failure function, fast and online
• Recognizing union-find trees is NP-complete
• Reconstructing a string from its Lyndon arrays
• String inference from longest-common-prefix array
• Experimental evaluation of algorithms for computing quasiperiods
• Universal reconstruction of a string
• Approximate cover of strings
• Can we recover the cover?
• Inferring strings from cover arrays
• Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)
• Efficient Reconstruction of RC-Equivalent Strings
• Universal reconstruction of a string
• Indeterminate string inference algorithms
• The set of parameterized k-covers problem
• Inferring strings from suffix trees and links on a binary alphabet
• Quasi-periodicity under mismatch errors
• Verifying an enhanced cover array in linear time
• Recognizing union-find trees is NP-complete, even without rank info
• Computing the cover array in linear time
• String Covering: A Survey
• Verifying and enumerating parameterized border arrays
• On suffix tree detection
• On suffix tree detection
• Computing string covers in sublinear time

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)