Reconstructing parameterized strings from parameterized suffix and LCP arrays

DOI10.1007/978-3-031-20643-6_5zbMath1525.68033MaRDI QIDQ6166972

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

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

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