Inferring a tree from walks

Theoretical Computer Science

Volumn 161, Issue 1-2, 1996, Pages 289-300

  Maruyama, Osamu ^a   Miyano, Satoru ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MARKOV PROCESSES; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

EDGE COLORS; FINITE NUMBER; LINEAR CHAIN; PARTIAL WALKS; POLYNOMIAL TIME; TREE INFERENCE; UNDIRECTED EDGE COLORED GRAPH;

TREES (MATHEMATICS);

EID: 0030182823     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00156-5     Document Type: Article

References (15)

1. D. Angluin, On the complexity of minimum inference of regular sets, Inform. and Control 39 (1978) 337-350.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd IEEE Symp. Foundations of Computer Science (1992) 14-23.
3. J.A. Aslam and R.L. Rivest. Inferring graphs from walks, in: Proc. 3rd Workshop on Computational Learning Theory (1990) 359-370.
4. A. Blum, T. Jiang, M. Li, J. Tromp and M. Yannakakis, Linear approximation of shortest superstrings, J. Assoc. Comput. Mach. 41 (1994) 630-647.
5. J. Gallant, D. Maier and J.A. Storer, On finding minimal length superstrings, J. Comput. System Sci. 20 (1980) 50-58.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
7. E.M. Gold, Complexity of automaton identification from given data, Inform. and Control 37 (1978) 302-320.
8. T. Jiang, M. Li and D. Du, A note on shortest superstrings with flipping, Inform. Process. Lett. 44 (1992) 195-199.
9. O. Maruyama and S. Miyano, Graph inference from a walk for trees of bounded degree 3 is NP-complete, in: Proc. 20th Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 969 (Springer, Berlin, 1995) 257-266.
10. C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
11. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, 1994).
12. L. Pitt and M.K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, J. Assoc. Comput. Mach. 40 (1993) 95-142.
13. V. Raghavan, Bounded degree graph inference from walks, J. Comput. System Sci. 49 (1994) 108-132.
14. S. Rudich, Inferring the structure of a Markov chain from its output, in: Proc. 26th IEEE Symp. Foundations of Computer Science (1985) 321-326.
15. A. Yamaguchi and S. Miyano, Approximating minimum common supertrees for complete k-ary trees, Tech. Report, Research Institute of Fundamental Information Science, Kyushu University, RIFIS-TR-CS 66, 1993.