2005 |
22 | EE | Osamu Maruyama,
Akiko Matsuda,
Satoru Kuhara:
Reconstructing Phylogenetic Trees of Prokaryote Genomes by Randomly Sampling Oligopeptides.
International Conference on Computational Science (2) 2005: 911-918 |
21 | EE | Osamu Maruyama,
Akiko Matsuda,
Satoru Kuhara:
Reconstructing phylogenetic trees of prokaryote genomes by randomly sampling oligopeptides.
IJBRA 1(4): 429-446 (2005) |
2004 |
20 | EE | Hiroki Sakai,
Osamu Maruyama:
Extensive Search for Discriminative Features of Alternative Splicing.
Pacific Symposium on Biocomputing 2004: 54-65 |
19 | EE | Daichi Shigemizu,
Osamu Maruyama:
Searching for Regulatory Elements of Alternative Splicing Events Using Phylogenetic Footprinting.
WABI 2004: 147-158 |
2003 |
18 | | Daisuke Shinozaki,
Tatsuya Akutsu,
Osamu Maruyama:
Finding optimal degenerate patterns in DNA sequences.
ECCB 2003: 206-214 |
17 | 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) |
2002 |
16 | 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 |
15 | | 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 |
14 | EE | Yoshinori Tamada,
Hideo Bannai,
Osamu Maruyama,
Satoru Miyano:
Foundations of Designing Computational Knowledge Discovery Processes.
Progress in Discovery Science 2002: 459-470 |
13 | | 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) |
12 | 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 |
11 | EE | Osamu Maruyama,
Takayoshi Shoudai,
Emiko Furuichi,
Satoru Kuhara,
Satoru Miyano:
Learning Conformation Rules.
Discovery Science 2001: 243-257 |
10 | EE | Hideo Bannai,
Yoshinori Tamada,
Osamu Maruyama,
Satoru Miyano:
VML: A View Modeling Language for Computational Knowledge Discovery.
Discovery Science 2001: 30-44 |
9 | | 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 |
8 | 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) |
1999 |
7 | EE | Osamu Maruyama,
Tomoyuki Uchida,
Kim Lan Sim,
Satoru Miyano:
Designing Views in HypothesisCreator: System for Assisting in Discovery.
Discovery Science 1999: 115-127 |
1998 |
6 | EE | Osamu Maruyama,
Tomoyuki Uchida,
Takayoshi Shoudai,
Satoru Miyano:
Toward Genomic Hypothesis Creator: View Designer for Discovery.
Discovery Science 1998: 105-116 |
5 | | Tatsuya Akutsu,
Satoru Kuhara,
Osamu Maruyama,
Satoru Miyano:
Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions.
SODA 1998: 695-702 |
1996 |
4 | | Erika Tateishi,
Osamu Maruyama,
Satoru Miyano:
Extracting Best Consensus Motifs from Positive and Negative Examples.
STACS 1996: 219-230 |
3 | EE | Osamu Maruyama,
Satoru Miyano:
Inferring a Tree from Walks.
Theor. Comput. Sci. 161(1&2): 289-300 (1996) |
1995 |
2 | | Osamu Maruyama,
Satoru Miyano:
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete.
MFCS 1995: 257-266 |
1992 |
1 | | Osamu Maruyama,
Satoru Miyano:
Inferring a Tree from Walks.
MFCS 1992: 383-391 |