Yamaguchi, A., Nakano, K., Miyano, S. An approximation algorithm for the minimum common supertree problem. Nordic J. Computing. 4(2):303-316, 1997.
Miyano, S. Genome Informatics: New Frontiers of Computer Science and Biosciences. Cooperative Databases and Applications (Advances Database Research and Development Series Vol. 7). Edited by Kambayashi, Y. and Yokota, K. (World Scientific). 12-21, 1997.
Furukawa, N., Matsumoto, S., Shinohara, A., Shoudai, T., Miyano, S. HAKKE: A multi-strategy prediction system for sequences. Genome Informatics. 7:98-107, 1996.
Maruyama, O., Miyano, S. Taking a walk on a graph. Mathematica Japonica. 43(3):595-606, 1996.
Maruyama, O., Miyano, S. Inferring a tree from walks. Theoretical Computer Science. 161(1-2):289-300, 1996.
Tateishi, E., Miyano, S. A greedy strategy for finding motifs from yes-no examples. Pacific Symposium on Biocomputing. 1:599-613, 1996.
Tateishi, E., Maruyama, O., Miyano, S. Extracting best consensus motifs from positive and negative examples. Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1046:219-230, 1996.
Miyano, S. Learning theory towards genome informatics. IEICE Transactions on Information and Systems. E78-D(5):560-567, 1995. (Invited paper: Miyano, S. Learning theory towards genome informatics. Proc. 4th International Workshop on Algorithmic Learning Theory, Lecture Notes in Computer Science. 744: 19-36, 1993.)
Shimozono, S., Miyano, S. Complexity of finding alphabet indexing. IEICE Transactions on Information and Systems. E78-D(1):13-18, 1995.
Shoudai, T., Miyano, S. Using maximal independent sets to solve problems in parallel. Theoretical Computer Science. 148(1):57-65, 1995.
Uchida, T., Shoudai, T., Miyano, S. Parallel algorithms for refutation tree problem on elementary formal graph systems. IEICE Transactions on Information and Systems. E78-D(2):99-112, 1995.
Shoudai, T., Lappe, M., Miyano, S., Shinohara, A., Okazaki, T., Arikawa, S., Uchida, T., Shimozono, S., Shinohara, T., Kuhara, S. BONSAI Garden: parallel knowledge discovery system for amino acid sequences. Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology. AAAI Press. 359-366, 1995.
Miyano, S., Shimozono, S., Maruyama, O. Some algorithmic problems arising from genome informatics. Advances in Computing Techniques - Algorithms, Databases and Prallel Processing. World Scientific, 45-59, 1995.
Uchida, T., Shoudai, T., Miyano, S. Polynomial time algorithm solving the refutation tree problem for formal graph systems. Bulletin of Informatics and Cybernetics. 26(1-2):55-74, 1994.
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. New Generation Computing. 11(3):361-375, 1993.
Arikawa, S., Shinohara, T., Miyano, S., Shinohara, A. More about learning elementary formal systems. Proceedings of Second International Workshop on Nonmonotonic and Inductive Logic. Lecture Notes in Computer Science. 659:107-117, 1993.
Furuya, S., Miyano, S. NP-hard aspects in analogical reasoning. Bulletin of Informatics and Cybernetics. 25(3-4):155-159, 1993.
Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., Arikawa, S. Finding alphabet indexing for decision trees over regular patterns: an approach to bioinformatical knowledge acquisition. Proceedings of the Twenty-Sixth Hawaii International Conference on System Sciences, Vol. I. IEEE Computer Society Press. 763-772, 1993.
Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., Arikawa, S. Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Transactions on Information Processing Society of Japan. 35(10):2009-2018, 1993.
Shinohara, A., Shimozono, S., Uchida, T., Miyano, S. Kuhara, S., Arikawa, S. Running learning systems in parallel for machine discovery from sequences. Genome Informatics. 4:74-83, 1993.
Shoudai, T., Miyano, S. A parallel algorithm for the maximal co-hitting set problem. IEICE Transactions on Information and Systems. E76-D(2):296-298, 1993.
Uchida, T., Miyano, S. O(log*n) time parallel algorithm for computing bounded degree maximal subgraphs. Journal of Information Processing. 16(1):16-20, 1993.
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. Proceedings of the Twenty-Fifth Hawaii International Conference on System Science, Vol. I. IEEE Computer Society Press. 675-684, 1992.
Arikawa, S., Miyano, S., Shinohara, A., Shimozono, S., Shinohara, T., Kuhara, S. Knowledge acquisition from amino acid sequences by learning algorithms. Proceedings of the Second Japanese Knowledge Acquisition for Knowledge-Based Systems Workshop. 109-128, 1992.
Arikawa, S., Miyano, S., Shinohara, A., Shinohara, T., Yamamoto, A. Algorithmic learning theory with elementary formal systems. IEICE Transactions on Information and Systems. E75-D(4):405-414, 1992.
Furuya, S., Miyano, S. NP-complete problems on label updating calculation in ATMS. Bulletin of Informatics and Cybernetics. 25(1-2):1-5, 1992.
Furuya, S., Miyano, S. Analogy is NP-hard. Proceedings of the Second Workshop on Algorithmic Learning Theory. 207-212, 1991.
Miyano, S. Δp2complete lexicographcially first maximal subgraph problems. Theoretical Computer Science. 88(1):33-57, 1991.
Miyano, S., Shinohara, A., Shinohara, T. Which classes of elementary formal systems are polynomial-time learnable? Proceedings of the Second Workshop on Algorithmic Learning Theory. 139-150, 1991.
Shinohara, A., Miyano, S. Teachability in computational learning. New Generation Computing. 8(4):337-347, 1991.
Miyano, S. Systematized approaches to the complexity of subgraph problems. Journal of Information Processing. 13(4):442-448, 1990.
Arikawa, S., Haraguchi, M., Inoue, H., Kawasaki, Y., Miyahara, T., Miyano, S., Oshima, K., Sakai, H., Shinohara, T., Shiraishi, S., Takeda, M., Takeya, S., Yamamoto, A., Yuasa, H. The text database management system SIGMA: an improvement of the main engine. Proceedings of Berliner Informatik-Tage. 72-81, 1989.
Miyano, S. The lexicographically first maximal subgraph problems - P-completeness and NC algorithms. Mathematical Systems Theory. 22(1):47-73, 1989.
Miyano, S. A parallelizable lexicographically first edge-induced subgraph problem. Information Processing Letters. 27(2):75-78, 1988.
Miyano, S. Indexing alternating finite automata and binary tree like circuits. Bulletin of Informatics and Cybernetics. 23(1-2):79-88, 1988.
Miyano, S. Parallel complexity and P-complete problems. Proceedings of International Conference on Fifth Generation Computer Systems 1988. 532-541, 1988.
Hayashi, T., Miyano, S. Finite tree automata on infinite trees. Bulletin of Informatics and Cybernetics. 21(3-4):71-82, 1985.
Miyano, S. Remarks on two-way automata with weak-counters. Information Processing Letters. 18(2):105-107, 1984.
Miyano, S., Hayashi, T. Alternating finite automata on ω-words. Theoretical Computer Science. 32(3):321-330, 1984.
Miyano, S. Remarks on multihead pushdown automata and multihead stack automata. Journal of Computer and System Sciences. 27(1):116-124, 1983.
Miyano, S. Two-way deterministic multi-weak-counter machines. Theoretical Computer Science. 21(1):27-32, 1982.
Miyano, S. A hierarchy theorem for multihead stack-counter automata. Acta Informatica. 17(1):63-67, 1982.
Miyano, S., Haraguchi, M. Recovery of incomplete tables under functional dependencies. Bulletin of Informatics and Cybernetics. 20(1-2):25-41, 1982.
Miyano, S. One-way weak-stack-counter automata. Journal of Computer and System Sciences. 20(1):59-76, 1980.
Miyano, S. On a lower bound of Shepherdson function. Memoirs of the Faculty of Science, Kyushu University, Ser. A. 33(2):257-267, 1979.
Hirokawa, S., Miyano, S. A note on the regularity of fuzzy languages. Memoirs of the Faculty of Science, Kyushu University, Ser. A. 32(1):61-66, 1978.
Miyano, S. On an automaton which recognizes a family of automata. Memoirs of the Faculty of Science, Kyushu University, Ser. A. 32(1):37-51, 1978.