Reconstructing parameterized strings from parameterized suffix and LCP arrays

DOI10.1007/978-3-031-20643-6_5MaRDI QIDQ6166972zbMATH OpenFDO

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

Publication date 4 August 2023

Published in String Processing and Information Retrieval (Search for Journal in Brave)

zbMATH Keywords

stringssuffix arrayparameterized stringslongest common prefix array

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• String inference from longest-common-prefix array
• String inference from longest-common-prefix array
• Lightweight parameterized suffix array construction
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
• RECONSTRUCTING A SUFFIX ARRAY

Cites work

• scientific article; zbMATH DE number 2119688 (Why is no real title available?)
• scientific article; zbMATH DE number 7559174 (Why is no real title available?)
• Algorithms – ESA 2004
• Alphabet dependence in parameterized matching
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Function Matching
• Mathematical Foundations of Computer Science 2003
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Parameterized matching with mismatches
• Parameterized pattern matching: Algorithms and applications
• Towards a real time algorithm for parameterized longest common prefix computation
• Words over an ordered alphabet and suffix permutations

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 Q6166972)