### 抄録

This paper introduces a new problem of inferring strings from graphs, and inferring strings from arrays. Given a graph G or an array A, we infer a string that suits the graph, or the array, under some condition. Firstly, we solve the problem of finding a string w such that the directed acyclic subsequence graph (DASG) of w is isomorphic to a given graph G. Secondly, we consider directed acyclic word graphs (DAWGs) in terms of string inference. Finally, we consider the problem of finding a string w of a minimal size alphabet, such that the suffix array (SA) of w is identical to a given permutation p = p _{1}, . . . , p _{n} of integers 1, . . . , n. Each of our three algorithms solving the above problems runs in linear time with respect to the input size.

元の言語 | 英語 |
---|---|

ページ（範囲） | 208-217 |

ページ数 | 10 |

ジャーナル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

巻 | 2747 |

出版物ステータス | 出版済み - 12 1 2003 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### これを引用

**Inferring strings from graphs and arrays.** / Bannai, Hideo; Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki.

研究成果: ジャーナルへの寄稿 › 記事

}

TY - JOUR

T1 - Inferring strings from graphs and arrays

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

PY - 2003/12/1

Y1 - 2003/12/1

N2 - This paper introduces a new problem of inferring strings from graphs, and inferring strings from arrays. Given a graph G or an array A, we infer a string that suits the graph, or the array, under some condition. Firstly, we solve the problem of finding a string w such that the directed acyclic subsequence graph (DASG) of w is isomorphic to a given graph G. Secondly, we consider directed acyclic word graphs (DAWGs) in terms of string inference. Finally, we consider the problem of finding a string w of a minimal size alphabet, such that the suffix array (SA) of w is identical to a given permutation p = p 1, . . . , p n of integers 1, . . . , n. Each of our three algorithms solving the above problems runs in linear time with respect to the input size.

AB - This paper introduces a new problem of inferring strings from graphs, and inferring strings from arrays. Given a graph G or an array A, we infer a string that suits the graph, or the array, under some condition. Firstly, we solve the problem of finding a string w such that the directed acyclic subsequence graph (DASG) of w is isomorphic to a given graph G. Secondly, we consider directed acyclic word graphs (DAWGs) in terms of string inference. Finally, we consider the problem of finding a string w of a minimal size alphabet, such that the suffix array (SA) of w is identical to a given permutation p = p 1, . . . , p n of integers 1, . . . , n. Each of our three algorithms solving the above problems runs in linear time with respect to the input size.

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

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

M3 - Article

VL - 2747

SP - 208

EP - 217

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -