Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays

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

doi:10.1007/978-3-031-20643-6_5

Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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
Title of host publication	String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings
Editors	Diego Arroyuelo, Diego Arroyuelo, Barbara Poblete
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	55-69
Number of pages	15
ISBN (Print)	9783031206429
DOIs	https://doi.org/10.1007/978-3-031-20643-6_5
State	Published - 2022
Event	29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 - Concepción, Chile Duration: 8 Nov 2022 → 10 Nov 2022

Publication series

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

Conference

Conference	29th International Symposium on String Processing and Information Retrieval, SPIRE 2022
Country/Territory	Chile
City	Concepción
Period	8/11/22 → 10/11/22

Bibliographical note

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

Funding

A. Amir—Partially supported by Grant No. 2018141 from the United States-Israel Binational Science Foundation (BSF) and Israel Science Foundation Grant 1475-18. C. Guerra—Partially supported by BSF Grant No. 2018141. G. M. Landau—Partially supported by Grant No. 2018141 from the United States-Israel Binational Science Foundation (BSF) and Israel Science Foundation Grant 1475-18. D. Sokol—Partially supported by BSF Grant No. 2018141.

Funders	Funder number
Bloom's Syndrome Foundation
United States-Israel Binational Science Foundation
Israel Science Foundation	1475-18

Keywords

Longest common prefix array
Parameterized strings
Strings
Suffix array

Access to Document

10.1007/978-3-031-20643-6_5

Cite this

Amir, A., Guerra, C., Kondratovsky, E., Landau, G. M., Marcus, S., & Sokol, D. (2022). Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. In D. Arroyuelo, D. Arroyuelo, & B. Poblete (Eds.), String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings (pp. 55-69). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13617 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20643-6_5

Amir, Amihood ; Guerra, Concettina ; Kondratovsky, Eitan et al. / Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. editor / Diego Arroyuelo ; Diego Arroyuelo ; Barbara Poblete. Springer Science and Business Media Deutschland GmbH, 2022. pp. 55-69 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6d1c079098764115851bcee6f22d477e,

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{\textquoteright}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 Concettina Guerra and Eitan Kondratovsky and Landau, {Gad M.} and Shoshana Marcus and Dina Sokol",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 ; Conference date: 08-11-2022 Through 10-11-2022",

year = "2022",

doi = "10.1007/978-3-031-20643-6_5",

language = "אנגלית",

isbn = "9783031206429",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "55--69",

editor = "Diego Arroyuelo and Diego Arroyuelo and Barbara Poblete",

booktitle = "String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings",

address = "גרמניה",

}

Amir, A, Guerra, C, Kondratovsky, E, Landau, GM, Marcus, S & Sokol, D 2022, Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. in D Arroyuelo, D Arroyuelo & B Poblete (eds), String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13617 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 55-69, 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, Concepción, Chile, 8/11/22. https://doi.org/10.1007/978-3-031-20643-6_5

Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. / Amir, Amihood; Guerra, Concettina; Kondratovsky, Eitan et al.
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. ed. / Diego Arroyuelo; Diego Arroyuelo; Barbara Poblete. Springer Science and Business Media Deutschland GmbH, 2022. p. 55-69 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13617 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays

AU - Amir, Amihood

AU - Guerra, Concettina

AU - Kondratovsky, Eitan

AU - Landau, Gad M.

AU - Marcus, Shoshana

AU - Sokol, Dina

PY - 2022

Y1 - 2022

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=85142732348&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-20643-6_5

DO - 10.1007/978-3-031-20643-6_5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85142732348

SN - 9783031206429

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 55

EP - 69

BT - String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings

A2 - Arroyuelo, Diego

A2 - Poblete, Barbara

PB - Springer Science and Business Media Deutschland GmbH

T2 - 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022

Y2 - 8 November 2022 through 10 November 2022

ER -

Amir A, Guerra C, Kondratovsky E, Landau GM, Marcus S, Sokol D. Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. In Arroyuelo D, Arroyuelo D, Poblete B, editors, String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 55-69. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-20643-6_5