# Inferring strings from graphs and arrays

36 引用 (Scopus)

### 抄録

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

Strings
Graph in graph theory
Suffix Array
Subsequence
benzoylprop-ethyl
Linear Time
Permutation
Isomorphic
Integer

### All Science Journal Classification (ASJC) codes

• Theoretical Computer Science
• Computer Science(all)

### これを引用

：: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻 2747, 01.12.2003, p. 208-217.

@article{4f98be8caa5545dd8585274e741e7d34,
title = "Inferring strings from graphs and arrays",
abstract = "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.",
author = "Hideo Bannai and Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2747",
pages = "208--217",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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 -