Advertisement

Inferring a tree from walks

  • Osamu Maruyama
  • Satoru Miyano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

Abstract

A walk of an edge-colored undirected graph G is a path which contains all edges in G. We show an O(n log n) time algorithm for finding the smallest tree from a walk which allows the walk. If the alphabet of colors is fixed, the algorithm runs in O(n) time. Further, we consider the problem of finding the smallest tree from partial walks, where a partial walk of G is a path in G. We prove that the problem turns to be NP-complete. We also show that inferring the smallest linear chain from partial walks is NP-complete, while the problem of inferring the smallest linear chain from a single walk is known to be solvable in polynomial time.

Keywords

Binary Relation Small Tree Linear Chain Vertex Cover Finite Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.: On the complexity of minimum inference of regular sets. Inform. Contr. 39 (1978) 337–350zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Arikawa, S., Kuhara, S., Miyano, S., Shinohara, A., Shinohara, T.:A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains. Proc. 25th Hawaii International Conference on System Sciences Vol. I (1992) 675–684Google Scholar
  3. 3.
    Arikawa, S., Kuhara, S., Miyano, S., Mukouchi, Y., Shinohara, A., Shinohara, T.:A machine discovery from amino acid sequences by decision trees over regular patterns, to appear in Proc. Fifth Generation Computer Systems 1992Google Scholar
  4. 4.
    Aslam, J.A., Rivest, R.L.: Inferring graphs from walks. Proc. 3rd Computational Learning Theory (1990) 359–370Google Scholar
  5. 5.
    Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. J. Comput. System Sci. 20 (1980) 50–58zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)Google Scholar
  7. 7.
    Gold, E.M.: Complexity of automaton identification from given data. Inform. Contr. 37 (1978) 302–320zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach. 27 (1980) 797–821zbMATHMathSciNetGoogle Scholar
  9. 9.
    Li, M.: Towards a DNA sequencing theory. Proc. 31st IEEE Symposium on Foundations of Computer Science (1990) 125–134Google Scholar
  10. 10.
    Raghavan, V.: Bounded degree graph inference from walks. Proc. 4th Computational Learning Theory (1991) 354–366Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Osamu Maruyama
    • 1
  • Satoru Miyano
    • 1
  1. 1.Department of Information SystemsKyushu University 39KasugaJapan

Personalised recommendations