Akutsu, T., Miyano, S. On the approximation of protein threading. Theoretical Computer Science. 210:261-275, 1999. (Extended abstract: Proceedings of the First Annual International Conference on Research in Computational Molecular Biology. 3-8, 1997.)
Akutsu, T., Miyano, S., Kuhara, S. Identification of genetic networks from a small number of gene expression patterns under the boolean network model. Pacific Symposium on Biocomputing. 4:17-28, 1999.
Bannai, H., Miyano, S. A definition of discovery in terms of generalized descriptional complexity. Proceedings of Second International Conference on Discovery Science. Lecture Notes in Artificial Intelligence. 1721:316-318, 1999.
Maruyama, O., Uchida, T., Sim, K.L., Miyano, S. Designing views in HypothesisCreator: System for assisting in discovery. Proceedings of Second International Conference on Discovery Science. Lecture Notes in Artificial Intelligence. 1721:115-127, 1999.
Moriyama, T., Shinohara, A., Takeda, M., Maruyama, O., Goto, T., Miyano, S., Kuhara, S. A system to find genetic networks using weighted network model. Genome Informatics. 10:186-195, 1999.
Nagasaki, M., Onami, S., Miyano, S., Kitano, H. Bio-calculus: its concept and molecular interaction. Genome Informatics. 10:133-143, 1999.
Yasuda, T., Bannai, H., Onami, S., Miyano, S., Kitano, H. Towards automatic construction of cell-linearge of C. elegans from Normarski DIC microscope images. Genome Informatics. 10:144-154, 1999.
Akutsu, T., Maruyama, O., Miyano, S., Kuhara, S. A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions. Genome Informatics. 9:151-160, 1998.
Maruyama, O., Uchida, T., Shoudai, T., Miyano, S. Toward Genomic Hypothesis Creator: View Designer for Discovery. Proceedings of First International Conference on Discovery Science. Lecture Notes in Artificial Intelligence. 1532:105-116, 1998.
Noda, K., Shinohara, A., Takeda, M., Matsumoto, S., Miyano, S., Kuhara, S. Finding genetic network from experiments by weighted network model. Genome Informatics. 9:141-150, 1998.
Usuzaka, S., Sim, K.L., Tanaka, M., Matsuno, H., Miyano, S. A machine learning approach to reducing the work of experts in article selection from database: a case study for regulatory relations of S. cerevisiae genes in MEDLINE. Genome Informatics. 9:91-101, 1998.
Yamaguchi, A., Nakano, K., Miyano, S. An approximation algorithm for the minimum common supertree problem. Nordic J. Computing. 4(2):303-316, 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.
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.
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., 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. p2-complete 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.
