| 2009 | ||
|---|---|---|
| 53 | Kengo Sato, Michiaki Hamada, Toutai Mituyama, Kiyoshi Asai, Yasubumi Sakakibara: A Non-parametric Bayesian Approach for Predicting RNA Secondary Structures. WABI 2009: 286-297 | |
| 52 | Tsuyoshi Hachiya, Yasunori Osana, Kris Popendorf, Yasubumi Sakakibara: Accurate identification of orthologous segments among multiple genomes. Bioinformatics 25(11): 1474 (2009) | |
| 51 | Tsuyoshi Hachiya, Yasunori Osana, Kris Popendorf, Yasubumi Sakakibara: Accurate identification of orthologous segments among multiple genomes. Bioinformatics 25(7): 853-860 (2009) | |
| 2008 | ||
| 50 | Yusuke Nakagawa, Katsuyuki Yugi, Kenji Tsuge, Mitsuhiro Itaya, Hiroshi Yanagawa, Yasubumi Sakakibara: Operon Structure Optimization by Random Self-assembly. DNA 2008: 33-40 | |
| 49 | Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubumi Sakakibara: Directed acyclic graph kernels for structural RNA analysis. BMC Bioinformatics 9: (2008) | |
| 48 | Kiyoshi Asai, Hisanori Kiryu, Michiaki Hamada, Yasuo Tabei, Kengo Sato, Hiroshi Matsui, Yasubumi Sakakibara, Goro Terai, Toutai Mituyama: Software.ncrna.org: web servers for analyses of RNA sequences. Nucleic Acids Research 36(Web-Server-Issue): 75-78 (2008) | |
| 2007 | ||
| 47 | Yasubumi Sakakibara, Kiyoshi Asai, Kengo Sato: Stem Kernels for RNA Sequence Analyses. BIRD 2007: 278-291 | |
| 46 | Nobuyoshi Nagamine, Yasubumi Sakakibara: Statistical prediction of protein-chemical interactions based on chemical structure and mass spectrometry data. Bioinformatics 23(15): 2004-2012 (2007) | |
| 45 | Yasubumi Sakakibara, Kris Popendorf, Nana Ogawa, Kiyoshi Asai, Kengo Sato: Stem Kernels for RNA Sequence Analyses. J. Bioinformatics and Computational Biology 5(5): 1103-1122 (2007) | |
| 44 | Georgios Paliouras, Yasubumi Sakakibara: Guest editorial to the special issue on grammatical inference. Machine Learning 66(1): 3-5 (2007) | |
| 2006 | ||
| 43 | Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita: Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings Springer 2006 | |
| 42 | Yuji Kawada, Yasubumi Sakakibara: Discriminative Detection of Cis-Acting Regulatory Variation From Location Data. APBC 2006: 89-98 | |
| 2005 | ||
| 41 | Yuji Kawada, Yasubumi Sakakibara: Discriminative Discovery of Transcription Factor Binding Sites from Location Data. CSB 2005: 86-89 | |
| 40 | Junna Kuramochi, Yasubumi Sakakibara: Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube. DNA 2005: 193-202 | |
| 39 | Hirotaka Nakagawa, Kensaku Sakamoto, Yasubumi Sakakibara: Development of an In Vivo Computer Based on Escherichia coli. DNA 2005: 203-212 | |
| 38 | Kengo Sato, Yasubumi Sakakibara: RNA secondary structural alignment with conditional random fields. ECCB/JBI 2005: 242 | |
| 37 | Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara: Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures. Bioinformatics 21(11): 2611-2617 (2005) | |
| 36 | Yasubumi Sakakibara: Development of a Bacteria Computer: From in silico Finite Automata to in virto AND in vivo. Bulletin of the EATCS 87: 165-178 (2005) | |
| 35 | Yasubumi Sakakibara: Grammatical Inference in Bioinformatics. IEEE Trans. Pattern Anal. Mach. Intell. 27(7): 1051-1062 (2005) | |
| 34 | Yasubumi Sakakibara: Learning context-free grammars using tabular representations. Pattern Recognition 38(9): 1372-1383 (2005) | |
| 2004 | ||
| 33 | Georgios Paliouras, Yasubumi Sakakibara: Grammatical Inference: Algorithms and Applications, 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004, Proceedings Springer 2004 | |
| 32 | Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara: An Algorithm for Testing Structure Freeness of Biomolecular Sequences. Aspects of Molecular Computing 2004: 266-277 | |
| 31 | Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara: Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures. CSB 2004: 290-299 | |
| 30 | Yasubumi Sakakibara, Hiroshi Imai: A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. Journal of Automata, Languages and Combinatorics 9(1): 111-119 (2004) | |
| 2003 | ||
| 29 | Yasubumi Sakakibara, Takahiro Hohsaka: In Vitro Translation-Based Computations. DNA 2003: 197-202 | |
| 28 | Yasubumi Sakakibara: Pair hidden Markov models on tree structures. ISMB (Supplement of Bioinformatics) 2003: 232-240 | |
| 27 | Yasubumi Sakakibara: DNA-based algorithms for learning Boolean formulae. Natural Computing 2(2): 153-171 (2003) | |
| 2002 | ||
| 26 | Yasubumi Sakakibara, Hiroshi Imai: A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. DNA 2002: 315-325 | |
| 25 | Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi: A Magic Pot : Self-assembly Computation Revisited. Formal and Natural Computing 2002: 418-430 | |
| 2001 | ||
| 24 | Yasubumi Sakakibara: Population Computation and Majority Inference in Test Tube. DNA 2001: 82-91 | |
| 23 | Yasubumi Sakakibara, Satoshi Kobayashi: Sticker systems with complex structures. Soft Comput. 5(2): 114-120 (2001) | |
| 22 | Satoshi Kobayashi, Yasubumi Sakakibara: Multiple splicing systems and the universal computability. Theor. Comput. Sci. 264(1): 3-23 (2001) | |
| 2000 | ||
| 21 | Yasubumi Sakakibara: Solving Computational Learning Problems of Boolean Formulae on DNA Computers. DNA Computing 2000: 220-230 | |
| 20 | Yasubumi Sakakibara, Hidenori Muramatsu: Learning Context-Free Grammars from Partially Structured Examples. ICGI 2000: 229-240 | |
| 1999 | ||
| 19 | Yasubumi Sakakibara, Mitsuhiro Kondo: GA-based Learning of Context-Free Grammars using Tabular Representations. ICML 1999: 354-360 | |
| 18 | Yasubumi Sakakibara, Claudio Ferretti: Splicing on Tree-Like Structures. Theor. Comput. Sci. 210(2): 227-243 (1999) | |
| 1997 | ||
| 17 | Christoph Globig, Klaus P. Jantke, Steffen Lange, Yasubumi Sakakibara: On Case Based Learnability of Language. New Generation Comput. 15(1): 39-83 (1997) | |
| 16 | Yasubumi Sakakibara: Recent Advances of Grammatical Inference. Theor. Comput. Sci. 185(1): 15-45 (1997) | |
| 1996 | ||
| 15 | Mostefa Golea, Masahiro Matsuoka, Yasubumi Sakakibara: Stochastic simple recurrent neural networks. ICGI 1996: 262-273 | |
| 1995 | ||
| 14 | Yasubumi Sakakibara: Grammatical Inference: An Old and New Paradigm. ALT 1995: 1-24 | |
| 1994 | ||
| 13 | Yasubumi Sakakibara, Klaus P. Jantke, Steffen Lange: Learning Languages by Collecting Cases and Tuning Parameters. AII/ALT 1994: 532-546 | |
| 12 | Yasubumi Sakakibara, Michael Brown, Richard Hughey, I. Saira Mian, Kimmen Sjölander, Rebecca C. Underwood, David Haussler: Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars. CPM 1994: 289-306 | |
| 11 | Yasubumi Sakakibara, Michael Brown, Rebecca C. Underwood, I. Saira Mian, David Haussler: Stochastic Context-Free Grammars for Modeling RN. HICSS (5) 1994: 284-294 | |
| 1993 | ||
| 10 | Yasubumi Sakakibara: Noise-Tolerant Occam Algorithms and Their Applications to Learning Decision Trees. Machine Learning 11: 37-62 (1993) | |
| 1992 | ||
| 9 | Yasubumi Sakakibara, Rani Siromoney: A Noise Model on Learning Sets of Strings. COLT 1992: 295-302 | |
| 8 | Yasubumi Sakakibara: Efficient Learning of Context-Free Grammars from Positive Structural Examples Inf. Comput. 97(1): 23-60 (1992) | |
| 1991 | ||
| 7 | Yasubumi Sakakibara: On Learning from Queries and Counterexamples in the Presence of Noise. Inf. Process. Lett. 37(5): 279-284 (1991) | |
| 1990 | ||
| 6 | Yasubumi Sakakibara: Occam Algorithms for Learning From Noisy Examples. ALT 1990: 193-208 | |
| 5 | Yuji Takada, Kunihiko Hiraishi, Yasubumi Sakakibara: Exact Learning of Semilinear Sets. ALT 1990: 314-324 | |
| 4 | Yasubumi Sakakibara: Learning Context-Free Grammars from Structural Data in Polynomial Time. Theor. Comput. Sci. 76(2-3): 223-242 (1990) | |
| 1988 | ||
| 3 | Yasubumi Sakakibara: Learning Context-Free Grammars from Structural Data in Polynomial Time. COLT 1988: 330-344 | |
| 2 | Yasubumi Sakakibara: An Efficient Learning of Context-Free Grammars for Bottom-Up Parsers. FGCS 1988: 447-454 | |
| 1986 | ||
| 1 | Yasubumi Sakakibara: Programming in Modal Logic: An Extension of PROLOG based on Modal Logic. LP 1986: 81-91 | |