| 2008 |
|---|
| 110 | EE | Osamu Hirose,
Ryo Yoshida,
Rui Yamaguchi,
Seiya Imoto,
Tomoyuki Higuchi,
Satoru Miyano:
Analyzing Time Course Gene Expression Data with Biological and Technical Replicates to Estimate Gene Networks by State Space Models.
Asia International Conference on Modelling and Simulation 2008: 940-946 |
| 109 | EE | Kaname Kojima,
Masao Nagasaki,
Satoru Miyano:
Fast grid layout algorithm for biological networks with sweep calculation.
Bioinformatics 24(12): 1433-1441 (2008) |
| 108 | EE | Osamu Hirose,
Ryo Yoshida,
Seiya Imoto,
Rui Yamaguchi,
Tomoyuki Higuchi,
Stephen D. Charnock-Jones,
Cristin G. Print,
Satoru Miyano:
Statistical inference of transcriptional module-based gene networks from time course gene expression profiles by using state space models.
Bioinformatics 24(7): 932-942 (2008) |
| 2007 |
|---|
| 107 | EE | Kazuyuki Numata,
Seiya Imoto,
Satoru Miyano:
A Structure Learning Algorithm for Inference of Gene Networks from Microarray Gene Expression Data Using Bayesian Networks.
BIBE 2007: 1280-1284 |
| 106 | EE | Ryo Yoshida,
Kazuyuki Numata,
Seiya Imoto,
Masao Nagasaki,
Atsushi Doi,
Kazuko Ueno,
Satoru Miyano:
Computational Genome-Wide Discovery of Aberrant Splice Variations with Exon Expression Profiles.
BIBE 2007: 715-722 |
| 105 | EE | Pramod K. Gupta,
Ryo Yoshida,
Seiya Imoto,
Rui Yamaguchi,
Satoru Miyano:
Statistical Absolute Evaluation of Gene Ontology Terms with Gene Expression Data.
ISBRA 2007: 146-157 |
| 104 | EE | Tatsuya Akutsu,
Hideo Bannai,
Satoru Miyano,
Sascha Ott:
On the complexity of deriving position specific score matrices from positive and negative sequences.
Discrete Applied Mathematics 155(6-7): 676-685 (2007) |
| 2006 |
|---|
| 103 | EE | Ryo Okada,
Manabu Sugii,
Hiroshi Matsuno,
Satoru Miyano:
Machine Learning Prediction of Amino Acid Patterns in Protein N-myristoylation.
PRIB 2006: 4-14 |
| 102 | EE | Seiya Imoto,
Yoshinori Tamada,
Hiromitsu Araki,
Kaori Yasuda,
Cristin G. Print,
Stephen D. Charnock-Jones,
Deborah Sanders,
Christopher J. Savoie,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Computational Strategy for Discovering Druggable Gene Networks from Genome-Wide RNA Expression Profiles.
Pacific Symposium on Biocomputing 2006: 559-571 |
| 101 | EE | Ryo Yoshida,
Tomoyuki Higuchi,
Seiya Imoto,
Satoru Miyano:
ArrayCluster: an analytic tool for clustering, data visualization and module finder on gene expression profiles.
Bioinformatics 22(12): 1538-1539 (2006) |
| 100 | EE | Hiroshi Matsuno,
Chen Li,
Satoru Miyano:
Petri Net Based Descriptions for Systematic Understanding of Biological Pathways.
IEICE Transactions 89-A(11): 3166-3174 (2006) |
| 99 | EE | Reiichiro Nakamichi,
Seiya Imoto,
Satoru Miyano:
Statistical Model Selection Method to Analyze Combinatorial Effects of Snps and Environmental Factors for Binary Disease.
International Journal on Artificial Intelligence Tools 15(5): 711-724 (2006) |
| 98 | EE | Hiroshi Matsuno,
Shin-Ichi T. Inouye,
Yasuki Okitsu,
Yasushi Fujii,
Satoru Miyano:
A New Regulatory Interaction Suggested by Simulations for Circadian Genetic Control Mechanism in Mammals.
J. Bioinformatics and Computational Biology 4(1): 139-154 (2006) |
| 97 | EE | Chen Li,
Shunichi Suzuki,
Qi-Wei Ge,
Mitsuru Nakata,
Hiroshi Matsuno,
Satoru Miyano:
Structural Modeling and Analysis of Signaling Pathways Based on Petri Nets.
J. Bioinformatics and Computational Biology 4(5): 1119-1140 (2006) |
| 96 | EE | Euna Jeong,
Satoru Miyano:
A Weighted Profile Based Method for Protein-RNA Interacting Residue Prediction.
T. Comp. Sys. Biology: 123-139 (2006) |
| 2005 |
|---|
| 95 | | Satoru Miyano,
Jill P. Mesirov,
Simon Kasif,
Sorin Istrail,
Pavel A. Pevzner,
Michael S. Waterman:
Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings
Springer 2005 |
| 94 | EE | Hiroshi Matsuno,
Shin-Ichi T. Inouye,
Yasuki Okitsu,
Yasushi Fujii,
Satoru Miyano:
A new regulatory interaction suggested by simulations for circadian genetic control mechanism in mammals.
APBC 2005: 171-180 |
| 93 | EE | Naoki Nariai,
Yoshinori Tamada,
Seiya Imoto,
Satoru Miyano:
Estimating gene regulatory networks and protein-protein interactions of Saccharomyces cerevisiae from multiple genome-wide data.
ECCB/JBI 2005: 212 |
| 92 | EE | Osamu Hirose,
Naoki Nariai,
Yoshinori Tamada,
Hideo Bannai,
Seiya Imoto,
Satoru Miyano:
Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks.
ICCSA (3) 2005: 349-356 |
| 91 | EE | Yuko Makita,
Michiel J. L. de Hoon,
Naotake Ogasawara,
Satoru Miyano,
Kenta Nakai:
Bayesian Joint Prediction of Associated Transcription Factors in Bacillus subtilis.
Pacific Symposium on Biocomputing 2005 |
| 90 | EE | Sascha Ott,
A. Hansen,
SunYong Kim,
Satoru Miyano:
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution.
Bioinformatics 21(2): 227-238 (2005) |
| 89 | EE | Yoshinori Tamada,
Hideo Bannai,
Seiya Imoto,
Toshiaki Katayama,
Minoru Kanehisa,
Satoru Miyano:
Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models.
J. Bioinformatics and Computational Biology 3(6): 1295-1314 (2005) |
| 2004 |
|---|
| 88 | EE | Masao Nagasaki,
Atsushi Doi,
Hiroshi Matsuno,
Satoru Miyano:
Integrating Biopathway Databases for Large-scale Modeling and Simulation.
APBC 2004: 43-52 |
| 87 | EE | Reiichiro Nakamichi,
Seiya Imoto,
Satoru Miyano:
Case-Control Study of Binary Disease Trait Considering Interactions between SNPs and Environmental Effects using Logistic Regression.
BIBE 2004: 73-78 |
| 86 | EE | Seiya Imoto,
Tomoyuki Higuchi,
SunYong Kim,
Euna Jeong,
Satoru Miyano:
Residual Bootstrapping and Median Filtering for Robust Estimation of Gene Networks from Microarray Data.
CMSB 2004: 149-160 |
| 85 | EE | Shunsuke Inenaga,
Hideo Bannai,
Heikki Hyyrö,
Ayumi Shinohara,
Masayuki Takeda,
Kenta Nakai,
Satoru Miyano:
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Discovery Science 2004: 32-46 |
| 84 | EE | Michiel J. L. de Hoon,
Yuko Makita,
Seiya Imoto,
Kazuo Kobayashi,
Naotake Ogasawara,
Kenta Nakai,
Satoru Miyano:
Predicting gene regulation by sigma factors in Bacillus subtilis from genome-wide data.
ISMB/ECCB (Supplement of Bioinformatics) 2004: 101-108 |
| 83 | EE | Tomohiro Ando,
Seiya Imoto,
Satoru Miyano:
Functional Data Analysis of the Dynamics of Gene Regulatory Networks.
KELSI 2004: 69-83 |
| 82 | EE | Michiel J. L. de Hoon,
Seiya Imoto,
Kazuo Kobayashi,
Naotake Ogasawara,
Satoru Miyano:
Predicting the Operon Structure of Bacillus subtilis Using Operon Length, Intergene Distance, and Gene Expression Information.
Pacific Symposium on Biocomputing 2004: 276-287 |
| 81 | EE | Naoki Nariai,
SunYong Kim,
Seiya Imoto,
Satoru Miyano:
Using Protein-Protein Interactions for Refining Gene Networks Estimated from Microarray Data by Bayesian Networks.
Pacific Symposium on Biocomputing 2004: 336-347 |
| 80 | EE | Sascha Ott,
Seiya Imoto,
Satoru Miyano:
Finding Optimal Models for Small Gene Networks.
Pacific Symposium on Biocomputing 2004: 557-567 |
| 79 | EE | Hideo Bannai,
Heikki Hyyrö,
Ayumi Shinohara,
Masayuki Takeda,
Kenta Nakai,
Satoru Miyano:
Finding Optimal Pairs of Patterns.
WABI 2004: 450-462 |
| 78 | EE | Hideo Bannai,
Heikki Hyyrö,
Ayumi Shinohara,
Masayuki Takeda,
Kenta Nakai,
Satoru Miyano:
An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.
IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 159-170 (2004) |
| 77 | EE | Atsushi Doi,
Sachie Fujita,
Hiroshi Matsuno,
Masao Nagasaki,
Satoru Miyano:
Constructing biological pathway models with hybrid functional Petri net.
In Silico Biology 4: (2004) |
| 76 | EE | Seiya Imoto,
Tomoyuki Higuchi,
Takao Goto,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Combining Microarrays and Biological Knowledge for Estimating Gene Networks via Bayesian Networks.
J. Bioinformatics and Computational Biology 2(1): 77-98 (2004) |
| 75 | EE | Hideo Bannai,
Shunsuke Inenaga,
Ayumi Shinohara,
Masayuki Takeda,
Satoru Miyano:
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
J. Bioinformatics and Computational Biology 2(2): 273-288 (2004) |
| 2003 |
|---|
| 74 | EE | SunYong Kim,
Seiya Imoto,
Satoru Miyano:
Dynamic Bayesian Network and Nonparametric Regression for Nonlinear Modeling of Gene Networks from Time Series Gene Expression Data.
CMSB 2003: 104-113 |
| 73 | EE | Masao Nagasaki,
Atsushi Doi,
Hiroshi Matsuno,
Satoru Miyano:
Recreating Biopathway Databases towards Simulation.
CMSB 2003: 168-169 |
| 72 | EE | Satoru Miyano:
Inference, Modeling and Simulation of Gene Networks.
CMSB 2003: 207-211 |
| 71 | EE | Seiya Imoto,
Tomoyuki Higuchi,
Takao Goto,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Combining Microarrays and Biological Knowledge for Estimating Gene Networks via Bayesian Networks.
CSB 2003: 104-113 |
| 70 | | Yoshinori Tamada,
SunYong Kim,
Hideo Bannai,
Seiya Imoto,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection.
ECCB 2003: 227-236 |
| 69 | EE | Hiroshi Matsuno,
Sachie Fujita,
Atsushi Doi,
Masao Nagasaki,
Satoru Miyano:
Towards Biopathway Modeling and Simulation.
ICATPN 2003: 3-22 |
| 68 | EE | Hiroshi Matsuno,
Ryutaro Murakani,
Rie Yamane,
Naoyuki Yamasaki,
Sachie Fujita,
Haruka Yoshimori,
Satoru Miyano:
Boundary Formation by Notch Signaling in Drosophila Multicellular Systems: Experimental Observations and Gene Network Modeling by Genomic Object Net.
Pacific Symposium on Biocomputing 2003: 152-163 |
| 67 | EE | Michiel J. L. de Hoon,
Seiya Imoto,
Kazuo Kobayashi,
Naotake Ogasawara,
Satoru Miyano:
Inferring Gene Regulatory Networks from Time-Ordered Gene Expression Data of Bacillus Subtilis Using Differential Equations.
Pacific Symposium on Biocomputing 2003: 17-28 |
| 66 | EE | Sascha Ott,
Yoshinori Tamada,
Hideo Bannai,
Kenta Nakai,
Satoru Miyano:
Intrasplicing - Analysis of Long Intron Sequences.
Pacific Symposium on Biocomputing 2003: 339-350 |
| 65 | | SunYong Kim,
Seiya Imoto,
Satoru Miyano:
Inferring gene networks from time series microarray data using dynamic Bayesian networks.
Briefings in Bioinformatics 4(3): 228 (2003) |
| 64 | EE | Hiroshi Matsuno,
Yukiko Tanaka,
Hitoshi Aoshima,
Atsushi Doi,
Mika Matsui,
Satoru Miyano:
Biopathways representation and simulation on hybrid functional Petri net.
In Silico Biology 3: 32 (2003) |
| 63 | EE | Seiya Imoto,
SunYong Kim,
Takao Goto,
Sachiyo Aburatani,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Bayesian Network and Nonparametric Heteroscedastic Regression for Nonlinear Modeling of Genetic Network.
J. Bioinformatics and Computational Biology 1(2): 231-252 (2003) |
| 62 | EE | Seiya Imoto,
Christopher J. Savoie,
Sachiyo Aburatani,
SunYong Kim,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Use of Gene Networks for Identifying and Validating Drug Targets.
J. Bioinformatics and Computational Biology 1(3): 459-474 (2003) |
| 61 | EE | Tatsuya Akutsu,
Satoru Kuhara,
Osamu Maruyama,
Satoru Miyano:
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model.
Theor. Comput. Sci. 1(298): 235-251 (2003) |
| 60 | | Tatsuya Akutsu,
Satoru Miyano,
Satoru Kuhara:
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis.
Theor. Comput. Sci. 292(2): 481-495 (2003) |
| 2002 |
|---|
| 59 | EE | Tatsuya Akutsu,
Hideo Bannai,
Satoru Miyano,
Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples.
CPM 2002: 168-177 |
| 58 | EE | Seiya Imoto,
SunYong Kim,
Takao Goto,
Sachiyo Aburatani,
Kousuke Tashiro,
Satoru Kuhara,
Satoru Miyano:
Bayesian Network and Nonparametric Heteroscedastic Regression for Nonlinear Modeling of Genetic Network.
CSB 2002: 219-227 |
| 57 | EE | Osamu Maruyama,
Takayoshi Shoudai,
Satoru Miyano:
Toward Drawing an Atlas of Hypothesis Classes: Approximating a Hypothesis via Another Hypothesis Model.
Discovery Science 2002: 220-232 |
| 56 | EE | Michiel J. L. de Hoon,
Seiya Imoto,
Satoru Miyano:
Inferring Gene Regulatory Networks from Time-Ordered Gene Expression Data Using Differential Equations.
Discovery Science 2002: 267-274 |
| 55 | | Osamu Maruyama,
Satoru Kuhara,
Hideo Bannai,
Satoru Miyano,
Yoshinori Tamada:
Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations.
JCIS 2002: 1180-1185 |
| 54 | EE | Seiya Imoto,
Takao Goto,
Satoru Miyano:
Estimation of Genetic Networks and Functional Structures Between Genes by Using Bayesian Networks and Nonparametric Regression.
Pacific Symposium on Biocomputing 2002: 175-186 |
| 53 | EE | Yoshinori Tamada,
Hideo Bannai,
Osamu Maruyama,
Satoru Miyano:
Foundations of Designing Computational Knowledge Discovery Processes.
Progress in Discovery Science 2002: 459-470 |
| 52 | | Michiel J. L. de Hoon,
Seiya Imoto,
Satoru Miyano:
Statistical analysis of a small set of time-ordered gene expression data using linear splines.
Bioinformatics 18(11): 1477-1485 (2002) |
| 51 | | Hideo Bannai,
Yoshinori Tamada,
Osamu Maruyama,
Kenta Nakai,
Satoru Miyano:
Extensive feature detection of N-terminal protein sorting signals.
Bioinformatics 18(2): 298-305 (2002) |
| 50 | EE | Osamu Maruyama,
Hideo Bannai,
Yoshinori Tamada,
Satoru Kuhara,
Satoru Miyano:
Fast algorithm for extracting multiple unordered short motifs using bit operations.
Inf. Sci. 146(1-4): 115-126 (2002) |
| 2001 |
|---|
| 49 | EE | Osamu Maruyama,
Takayoshi Shoudai,
Emiko Furuichi,
Satoru Kuhara,
Satoru Miyano:
Learning Conformation Rules.
Discovery Science 2001: 243-257 |
| 48 | EE | Hideo Bannai,
Yoshinori Tamada,
Osamu Maruyama,
Satoru Miyano:
VML: A View Modeling Language for Computational Knowledge Discovery.
Discovery Science 2001: 30-44 |
| 47 | | Hideo Bannai,
Yoshinori Tamada,
Osamu Maruyama,
Kenta Nakai,
Satoru Miyano:
Views: Fundamental Building Blocks in the Process of Knowledge Discovery.
FLAIRS Conference 2001: 233-238 |
| 46 | | Kim Lan Sim,
Tomoyuki Uchida,
Satoru Miyano:
ProDDO: a database of disordered proteins from the Protein Data Bank (PDB).
Bioinformatics 17(4): 379-380 (2001) |
| 45 | EE | Hideo Bannai,
Yoshinori Tamada,
Osamu Maruyama,
Satoru Miyano:
HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process.
Electron. Trans. Artif. Intell. 5(B): 73-83 (2001) |
| 44 | EE | Russ B. Altman,
Alfonso Valencia,
Satoru Miyano,
Shoba Ranganathan:
Challenges for Intelligent Systems in Biology.
IEEE Intelligent Systems 16(6): 14-20 (2001) |
| 2000 |
|---|
| 43 | EE | Tatsuya Akutsu,
Satoru Miyano,
Satoru Kuhara:
A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Case Anaylsis.
Discovery Science 2000: 86-98 |
| 42 | EE | Tatsuya Akutsu,
Satoru Miyano,
Satoru Kuhara:
Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function.
RECOMB 2000: 8-14 |
| 41 | | Tatsuya Akutsu,
Satoru Miyano,
Satoru Kuhara:
Inferring qualitative relations in genetic networks and metabolic pathways.
Bioinformatics 16(8): 727-734 (2000) |
| 40 | | Tatsuya Akutsu,
Satoru Miyano,
Satoru Kuhara:
Algorithms for Identifying Boolean Networks and Related Biological Networks Based on Matrix Multiplication and Fingerprint Function.
Journal of Computational Biology 7(3-4): 331-343 (2000) |
| 39 | | Satoru Miyano,
Ayumi Shinohara,
Takeshi Shinohara:
Polynomial-time Learning of Elementary Formal Systems.
New Generation Comput. 18(3): 217-242 (2000) |
| 1999 |
|---|
| 38 | EE | Osamu Maruyama,
Tomoyuki Uchida,
Kim Lan Sim,
Satoru Miyano:
Designing Views in HypothesisCreator: System for Assisting in Discovery.
Discovery Science 1999: 115-127 |
| 37 | EE | Hideo Bannai,
Satoru Miyano:
A Definition of Discovery in Terms of Generalized Descriptional Complexity.
Discovery Science 1999: 316-318 |
| 36 | EE | Tatsuya Akutsu,
Satoru Miyano,
Satoru Kuhara:
Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model.
Pacific Symposium on Biocomputing 1999: 17-28 |
| 35 | | Ying Xu,
Satoru Miyano,
Tom Head:
Foreword.
J. Comb. Optim. 3(2-3): 147-148 (1999) |
| 34 | EE | Satoru Miyano:
Foreword: Genome Informatics.
Theor. Comput. Sci. 210(2): 225-226 (1999) |
| 33 | EE | Tatsuya Akutsu,
Satoru Miyano:
On the Approximation of Protein Threading.
Theor. Comput. Sci. 210(2): 261-275 (1999) |
| 1998 |
|---|
| 32 | EE | Osamu Maruyama,
Tomoyuki Uchida,
Takayoshi Shoudai,
Satoru Miyano:
Toward Genomic Hypothesis Creator: View Designer for Discovery.
Discovery Science 1998: 105-116 |
| 31 | | Tatsuya Akutsu,
Satoru Kuhara,
Osamu Maruyama,
Satoru Miyano:
Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions.
SODA 1998: 695-702 |
| 1997 |
|---|
| 30 | EE | Tatsuya Akutsu,
Satoru Miyano:
On the approximation of protein threading.
RECOMB 1997: 3-8 |
| 29 | | Atsuko Yamaguchi,
Koji Nakano,
Satoru Miyano:
An Approximation Algorithm for the Minimum Common Supertree Problem.
Nord. J. Comput. 4(2): 303-316 (1997) |
| 1996 |
|---|
| 28 | | Tetsuo Asano,
Yoshihide Igarashi,
Hiroshi Nagamochi,
Satoru Miyano,
Subhash Suri:
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings
Springer 1996 |
| 27 | | Satoru Miyano:
Genome Informatics: New Frontiers of Computer Science and Biosciences.
CODAS 1996: 12-21 |
| 26 | | Erika Tateishi,
Osamu Maruyama,
Satoru Miyano:
Extracting Best Consensus Motifs from Positive and Negative Examples.
STACS 1996: 219-230 |
| 25 | EE | Osamu Maruyama,
Satoru Miyano:
Inferring a Tree from Walks.
Theor. Comput. Sci. 161(1&2): 289-300 (1996) |
| 1995 |
|---|
| 24 | | Satoru Miyano:
Algorithmic Problems Arising from Genome Informatics (Abstract).
ISAAC 1995: 1 |
| 23 | | Takayoshi Shoudai,
Michael Lappe,
Satoru Miyano,
Ayumi Shinohara,
Takeo Okazaki,
Setsuo Arikawa,
Tomoyuki Uchida,
Shinichi Shimozono,
Takeshi Shinohara,
Satoru Kuhara:
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
ISMB 1995: 359-358 |
| 22 | | Osamu Maruyama,
Satoru Miyano:
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete.
MFCS 1995: 257-266 |
| 21 | EE | Takayoshi Shoudai,
Satoru Miyano:
Using Maximal Independent Sets to Solve Problems in Parallel.
Theor. Comput. Sci. 148(1): 57-65 (1995) |
| 1994 |
|---|
| 20 | | Satoru Miyano,
Ayumi Shinohara:
Machine Learning and Discovery for Bloinformatics: Introduction.
HICSS (5) 1994: 111-112 |
| 1993 |
|---|
| 19 | | Satoru Miyano:
Learning Theory Toward Genome Informatics.
ALT 1993: 19-36 |
| 18 | | Setsuo Arikawa,
Satoru Miyano,
Ayumi Shinohara,
Satoru Kuhara,
Yasuhito Mukouchi,
Takeshi Shinohara:
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
New Generation Comput. 11(3): 361-375 (1993) |
| 1992 |
|---|
| 17 | | Setsuo Arikawa,
Satoru Kuhara,
Satoru Miyano,
Yasuhito Mukouchi,
Ayumi Shinohara,
Takeshi Shinohara:
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
FGCS 1992: 618-625 |
| 16 | | Osamu Maruyama,
Satoru Miyano:
Inferring a Tree from Walks.
MFCS 1992: 383-391 |
| 1991 |
|---|
| 15 | | Setsuo Arikawa,
Takeshi Shinohara,
Satoru Miyano,
Ayumi Shinohara:
More About Learning Elementary Formal Systems.
Nonmonotonic and Inductive Logic 1991: 107-117 |
| 14 | | Satoru Miyano:
Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems.
Theor. Comput. Sci. 88(1): 33-57 (1991) |
| 1990 |
|---|
| 13 | | Ayumi Shinohara,
Satoru Miyano:
Teachability in Computational Learning.
ALT 1990: 247-255 |
| 1989 |
|---|
| 12 | | Satoru Miyano:
The Lexicographically First Maximum Subgraph Problems: P-Completeness and NC Algorithms.
Mathematical Systems Theory 22(1): 47-73 (1989) |
| 1988 |
|---|
| 11 | | Satoru Miyano:
Parallel Complexity and P-Complete Problems.
FGCS 1988: 532-541 |
| 10 | | Satoru Miyano:
Delta2p-Complete Lexicographically First Maximal Subgraph Problems.
MFCS 1988: 454-462 |
| 9 | | Satoru Miyano:
A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem.
Inf. Process. Lett. 27(2): 75-78 (1988) |
| 1987 |
|---|
| 8 | | Satoru Miyano:
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms.
ICALP 1987: 425-434 |
| 1984 |
|---|
| 7 | | Satoru Miyano,
Takeshi Hayashi:
Alternating Finite Automata on omega-Words.
CAAP 1984: 195-210 |
| 6 | | Satoru Miyano:
Remarks on Two-Way Automata with Weak-Counters.
Inf. Process. Lett. 18(2): 105-107 (1984) |
| 5 | | Satoru Miyano,
Takeshi Hayashi:
Alternating Finite Automata on omega-Words.
Theor. Comput. Sci. 32: 321-330 (1984) |
| 1983 |
|---|
| 4 | | Satoru Miyano:
Remarks on Multihead Pushdown Automata and Multihead Stack Automata.
J. Comput. Syst. Sci. 27(1): 116-124 (1983) |
| 1982 |
|---|
| 3 | | Satoru Miyano:
A Hierarchy Theorem for Multihead Stack-Counter Automata.
Acta Inf. 17: 63-67 (1982) |
| 2 | | Satoru Miyano:
Two-Way Deterministic Multi-Weak-Counter Machines.
Theor. Comput. Sci. 21: 27-37 (1982) |
| 1980 |
|---|
| 1 | | Satoru Miyano:
One-Way Weak-Stack-Counter Automata.
J. Comput. Syst. Sci. 20(1): 59-76 (1980) |
