| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Atsuko Yamaguchi Kiyoko F. Aoki , Nobuhisa Ueda , Atsuko Yamaguchi, Minoru Kanehisa , Tatsuya Akutsu , Hiroshi Mamitsuka : Application of a new probabilistic model for recognizing complex patterns in glycans. ISMB/ECCB (Supplement of Bioinformatics) 2004 : 6-14 Atsuko Yamaguchi, Kiyoko F. Aoki , Hiroshi Mamitsuka : Finding the maximum common subgraph of a partial k -tree and a graph with a polynomially bounded number of spanning trees. Inf. Process. Lett. 92 (2): 57-63 (2004) Kiyoko F. Aoki , Atsuko Yamaguchi, Nobuhisa Ueda , Tatsuya Akutsu , Hiroshi Mamitsuka , Susumu Goto , Minoru Kanehisa : KCaM (KEGG Carbohydrate Matcher): a software tool for analyzing the structures of carbohydrate sugar chains. Nucleic Acids Research 32 (Web-Server-Issue): 267-272 (2004) Kiyoko F. Aoki , Nobuhisa Ueda , Atsuko Yamaguchi, Tatsuya Akutsu , Minoru Kanehisa , Hiroshi Mamitsuka : Managing and Analyzing Carbohydrate Data. SIGMOD Record 33 (2): 33-38 (2004) Atsuko Yamaguchi, Hiroshi Mamitsuka : Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. ISAAC 2003 : 58-67 Hiroshi Mamitsuka , Yasushi Okuno , Atsuko Yamaguchi: Mining biologically active patterns in metabolic pathways using microarray expression profiles. SIGKDD Explorations 5 (2): 113-121 (2003) Atsuko Yamaguchi, Akihiro Sugimoto : An Approximation Algorithm for the Two-Layered Graph Drawing Problem. COCOON 1999 : 81-91 Atsuko Yamaguchi, Koji Nakano , Satoru Miyano : An Approximation Algorithm for the Minimum Common Supertree Problem. Nord. J. Comput. 4 (2): 303-316 (1997) 1 [ 5 ] [ 6 ] [ 8 ] 2 [ 5 ] [ 6 ] [ 7 ] [ 8 ] 3 [ 6 ] 4 [ 5 ] [ 6 ] [ 8 ] 5 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] 6 [ 1 ] 7 [ 1 ] 8 [ 3 ] 9 [ 2 ] 10 [ 5 ] [ 6 ] [ 8 ]  ©2005 Association for Computing Machinery |
