Reconstructing parameterized strings from parameterized suffix and LCP arrays

DOI10.1016/J.TCS.2023.114230MaRDI QIDQ6199197zbMATH OpenFDO

Authors Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol

Publication date 23 February 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2023.114230

zbMATH Keywords

longest common prefix arrayparameterized stringsstringssuffix array

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Alphabet dependence in parameterized matching
• Fast Algorithms for Finding Nearest Common Ancestors
• scientific article; zbMATH DE number 2119688 (Why is no real title available?)
• Inferring strings from Lyndon factorization
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Parameterized matching with mismatches
• Parameterized pattern matching: Algorithms and applications
• RECONSTRUCTING A SUFFIX ARRAY
• String inference from longest-common-prefix array
• Validating the Knuth-Morris-Pratt failure function, fast and online
• Words over an ordered alphabet and suffix permutations

Cited in

(3)

• On the complexity of indeterminate strings matching
• Inverting parameterized Burrows-Wheeler transform
• Reconstructing general matching graphs

This page was built for publication: Reconstructing parameterized strings from parameterized suffix and LCP arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199197)