Inferring Strings from Graphs and Arrays

  • Hideo Bannai
  • Shunsuke Inenaga
  • Ayumi Shinohara
  • Masayuki Takeda
Conference paper

DOI: 10.1007/978-3-540-45138-9_15

Volume 2747 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bannai H., Inenaga S., Shinohara A., Takeda M. (2003) Inferring Strings from Graphs and Arrays. In: Rovan B., Vojtáš P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg

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=p1,...,pn of integers 1,...,n. Each of our three algorithms solving the above problems runs in linear time with respect to the input size.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Hideo Bannai
    • 1
  • Shunsuke Inenaga
    • 2
  • Ayumi Shinohara
    • 2
    • 3
  • Masayuki Takeda
    • 2
    • 3
  1. 1.Human Genome Center, Institute of Medical ScienceUniversity of TokyoMinato-ku, TokyoJapan
  2. 2.Department of InformaticsFukuokaJapan
  3. 3.PRESTOJapan Science and Technology Corporation (JST)