Recovering, counting and enumerating strings from forward and backward suffix arrays

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

The suffix array SAw of a string w of length n is a permutation of [1..n] such that SAw[i]=j iff w[j, n] is the lexicographically i-th suffix of w. In this paper, we consider variants of the reverse-engineering problem on suffix arrays with two given permutations P and Q of [1..n], such that P refers to the forward suffix array of some string w and Q refers to the backward suffix array of the reversed string wR. Our results are the following: (1) An algorithm which computes a solution string over an alphabet of the smallest size, in O(n) time. (2) The exact number of solution strings over an alphabet of size σ. (3) An efficient algorithm which computes all solution strings in the lexicographical order, in time near optimal up to log n factor.

元の言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings
編集者Travis Gagie, Alistair Moffat, Gonzalo Navarro, Ernesto Cuadros-Vargas
出版者Springer Verlag
ページ254-267
ページ数14
ISBN(印刷物)9783030004781
DOI
出版物ステータス出版済み - 1 1 2018
イベント25th International Symposium on String Processing and Information Retrieval, SPIRE 2018 - Lima, ペルー
継続期間: 10 9 201810 11 2018

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11147 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他25th International Symposium on String Processing and Information Retrieval, SPIRE 2018
ペルー
Lima
期間10/9/1810/11/18

Fingerprint

Suffix Array
Counting
Strings
Reverse engineering
Permutation
Suffix
Reverse Engineering
Number of Solutions
Efficient Algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Kuhara, Y., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2018). Recovering, counting and enumerating strings from forward and backward suffix arrays. : T. Gagie, A. Moffat, G. Navarro, & E. Cuadros-Vargas (版), String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings (pp. 254-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 11147 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-00479-8_21

Recovering, counting and enumerating strings from forward and backward suffix arrays. / Kuhara, Yuki; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. 版 / Travis Gagie; Alistair Moffat; Gonzalo Navarro; Ernesto Cuadros-Vargas. Springer Verlag, 2018. p. 254-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 11147 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Kuhara, Y, Nakashima, Y, Inenaga, S, Bannai, H & Takeda, M 2018, Recovering, counting and enumerating strings from forward and backward suffix arrays. : T Gagie, A Moffat, G Navarro & E Cuadros-Vargas (版), String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 11147 LNCS, Springer Verlag, pp. 254-267, 25th International Symposium on String Processing and Information Retrieval, SPIRE 2018, Lima, ペルー, 10/9/18. https://doi.org/10.1007/978-3-030-00479-8_21
Kuhara Y, Nakashima Y, Inenaga S, Bannai H, Takeda M. Recovering, counting and enumerating strings from forward and backward suffix arrays. : Gagie T, Moffat A, Navarro G, Cuadros-Vargas E, 編集者, String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. Springer Verlag. 2018. p. 254-267. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-00479-8_21
Kuhara, Yuki ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Recovering, counting and enumerating strings from forward and backward suffix arrays. String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. 編集者 / Travis Gagie ; Alistair Moffat ; Gonzalo Navarro ; Ernesto Cuadros-Vargas. Springer Verlag, 2018. pp. 254-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c66a28d5527b4de69a468b72febc6910,
title = "Recovering, counting and enumerating strings from forward and backward suffix arrays",
abstract = "The suffix array SAw of a string w of length n is a permutation of [1..n] such that SAw[i]=j iff w[j, n] is the lexicographically i-th suffix of w. In this paper, we consider variants of the reverse-engineering problem on suffix arrays with two given permutations P and Q of [1..n], such that P refers to the forward suffix array of some string w and Q refers to the backward suffix array of the reversed string wR. Our results are the following: (1) An algorithm which computes a solution string over an alphabet of the smallest size, in O(n) time. (2) The exact number of solution strings over an alphabet of size σ. (3) An efficient algorithm which computes all solution strings in the lexicographical order, in time near optimal up to log n factor.",
author = "Yuki Kuhara and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-00479-8_21",
language = "English",
isbn = "9783030004781",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "254--267",
editor = "Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros-Vargas",
booktitle = "String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Recovering, counting and enumerating strings from forward and backward suffix arrays

AU - Kuhara, Yuki

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The suffix array SAw of a string w of length n is a permutation of [1..n] such that SAw[i]=j iff w[j, n] is the lexicographically i-th suffix of w. In this paper, we consider variants of the reverse-engineering problem on suffix arrays with two given permutations P and Q of [1..n], such that P refers to the forward suffix array of some string w and Q refers to the backward suffix array of the reversed string wR. Our results are the following: (1) An algorithm which computes a solution string over an alphabet of the smallest size, in O(n) time. (2) The exact number of solution strings over an alphabet of size σ. (3) An efficient algorithm which computes all solution strings in the lexicographical order, in time near optimal up to log n factor.

AB - The suffix array SAw of a string w of length n is a permutation of [1..n] such that SAw[i]=j iff w[j, n] is the lexicographically i-th suffix of w. In this paper, we consider variants of the reverse-engineering problem on suffix arrays with two given permutations P and Q of [1..n], such that P refers to the forward suffix array of some string w and Q refers to the backward suffix array of the reversed string wR. Our results are the following: (1) An algorithm which computes a solution string over an alphabet of the smallest size, in O(n) time. (2) The exact number of solution strings over an alphabet of size σ. (3) An efficient algorithm which computes all solution strings in the lexicographical order, in time near optimal up to log n factor.

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

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

U2 - 10.1007/978-3-030-00479-8_21

DO - 10.1007/978-3-030-00479-8_21

M3 - Conference contribution

SN - 9783030004781

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

SP - 254

EP - 267

BT - String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings

A2 - Gagie, Travis

A2 - Moffat, Alistair

A2 - Navarro, Gonzalo

A2 - Cuadros-Vargas, Ernesto

PB - Springer Verlag

ER -