| 2005 |
|---|
| 9 | EE | Nobuhisa Ueda,
Kiyoko F. Aoki-Kinoshita,
Atsuko Yamaguchi,
Tatsuya Akutsu,
Hiroshi Mamitsuka:
A Probabilistic Model for Mining Labeled Ordered Trees: Capturing Patterns in Carbohydrate Sugar Chains.
IEEE Trans. Knowl. Data Eng. 17(8): 1051-1064 (2005) |
| 2004 |
|---|
| 8 | EE | 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 |
| 7 | EE | 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) |
| 6 | | 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) |
| 5 | EE | 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) |
| 2003 |
|---|
| 4 | EE | 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 |
| 3 | EE | Hiroshi Mamitsuka,
Yasushi Okuno,
Atsuko Yamaguchi:
Mining biologically active patterns in metabolic pathways using microarray expression profiles.
SIGKDD Explorations 5(2): 113-121 (2003) |
| 1999 |
|---|
| 2 | EE | Atsuko Yamaguchi,
Akihiro Sugimoto:
An Approximation Algorithm for the Two-Layered Graph Drawing Problem.
COCOON 1999: 81-91 |
| 1997 |
|---|
| 1 | | Atsuko Yamaguchi,
Koji Nakano,
Satoru Miyano:
An Approximation Algorithm for the Minimum Common Supertree Problem.
Nord. J. Comput. 4(2): 303-316 (1997) |
