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

Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

1 被引用数 (Scopus)

抄録

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
出版ステータス出版済み - 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
国/地域ペルー
CityLima
Period10/9/1810/11/18

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Recovering, counting and enumerating strings from forward and backward suffix arrays」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル