Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Reconstructing input from a data structure entails determining whether an instance of the data structure is in fact valid or not, and if valid, discovering the underlying data that it represents. In this paper we consider the parameterized suffix array (pSA) along with its corresponding parameterized longest-common-prefix (pLCP) array and solve the following problem. Given two arrays of numbers as input, A and P, does there exist a parameterized string S such that A is its pSA and P is its pLCP array? If the answer is positive, our algorithm produces a string S whose pSA is A and whose pLCP array is P. Although the naive approach would have to consider an exponential number of possibilities for such a string S, our algorithm’s time complexity is only O(n2) for input arrays of size n.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings
EditorsDiego Arroyuelo, Diego Arroyuelo, Barbara Poblete
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages15
ISBN (Print)9783031206429
StatePublished - 2022
Event29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 - Concepción, Chile
Duration: 8 Nov 202210 Nov 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13617 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference29th International Symposium on String Processing and Information Retrieval, SPIRE 2022

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.


  • Longest common prefix array
  • Parameterized strings
  • Strings
  • Suffix array

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays'. Together they form a unique fingerprint.

Cite this