Reconstructing parameterized strings from parameterized suffix and LCP arrays

DOI10.1007/978-3-031-20643-6_5zbMATH Open1525.68033MaRDI QIDQ6166972FDOQ6166972

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

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)

Cites Work

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

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)