Name
Title | ||
|---|---|---|
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. |
Abstract | ||
|---|---|---|
The suffix array SA(w) of a string w of length n is a permutation of [1..n] such that SA(w)[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 w(R). Our results are the following: (1) An algorithm which computes a solution string over an alphabet of the smallest size, in 0(n) time. (2) The exact number of solution strings over an alphabet of size sigma. (3) An efficient algorithm which computes all solution strings in the lexicographical order, in time near optimal up to log n factor. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-00479-8_21 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Binary logarithm,Combinatorics,Suffix,Computer science,Permutation,Suffix array,Sigma,Lexicographical order,Alphabet | Conference | 11147 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
13 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuki Kuhara | 1 | 0 | 0.34 |
| Yuto Nakashima | 2 | 57 | 19.52 |
| Shunsuke Inenaga | 3 | 595 | 79.02 |
| Hideo Bannai | 4 | 620 | 79.87 |
| Masayuki Takeda | 5 | 9 | 13.78 |