Reconstructing parameterized strings from parameterized suffix and LCP arrays

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

doi:10.1016/j.tcs.2023.114230

Reconstructing parameterized strings from parameterized suffix and LCP arrays

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

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

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(n²) for input arrays of size n.

Original language	English
Article number	114230
Journal	Theoretical Computer Science
Volume	981
DOIs	https://doi.org/10.1016/j.tcs.2023.114230
State	Published - 4 Jan 2024

Bibliographical note

Publisher Copyright:
© 2023

Funding

Partially supported by Grant No. 2018141 from the United States-Israel Binational Science Foundation (BSF) and Israel Science Foundation Grant 22-168-23.Partially supported by the Professional Staff Congress of the City University of New York (PSC-CUNY) grant number 66557-00 54.Partially supported by Grant No. 2018141 from the United States-Israel Binational Science Foundation (BSF).The authors declare the following financial interests/personal relationships which may be considered as potential competing interests: Dina Sokol, Amihood Amir, Gad M. Landau reports financial support was provided by Binational Science Foundation.

Funders	Funder number
City University of New York
Professional Staff Congress and City University of New York	66557-00 54
United States-Israel Binational Science Foundation
Israel Science Foundation	22-168-23

Keywords

Longest common prefix array
Parameterized strings
Strings
Suffix array

Access to Document

10.1016/j.tcs.2023.114230

Cite this

@article{4ef86149d2574ad7984729749419f68a,

title = "Reconstructing parameterized strings from parameterized suffix and LCP arrays",

abstract = "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.",

keywords = "Longest common prefix array, Parameterized strings, Strings, Suffix array",

author = "Amihood Amir and Eitan Kondratovsky and Landau, {Gad M.} and Shoshana Marcus and Dina Sokol",

note = "Publisher Copyright: {\textcopyright} 2023",

year = "2024",

month = jan,

day = "4",

doi = "10.1016/j.tcs.2023.114230",

language = "אנגלית",

volume = "981",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Reconstructing parameterized strings from parameterized suffix and LCP arrays

AU - Amir, Amihood

AU - Kondratovsky, Eitan

AU - Landau, Gad M.

AU - Marcus, Shoshana

AU - Sokol, Dina

PY - 2024/1/4

Y1 - 2024/1/4

N2 - 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.

AB - 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.

KW - Longest common prefix array

KW - Parameterized strings

KW - Strings

KW - Suffix array

UR - http://www.scopus.com/inward/record.url?scp=85174842403&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2023.114230

DO - 10.1016/j.tcs.2023.114230

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85174842403

SN - 0304-3975

VL - 981

JO - Theoretical Computer Science

JF - Theoretical Computer Science

M1 - 114230

ER -

Reconstructing parameterized strings from parameterized suffix and LCP arrays

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this